Data processing: database and file management or data structures – Database design – Data structure types
Patent
1998-02-12
1999-12-14
Amsbury, Wayne
Data processing: database and file management or data structures
Database design
Data structure types
707 3, 707 5, 707100, 707101, 707501, G06F 1730
Patent
active
060030364
ABSTRACT:
A data structure that uses one or more keys which are members of a multidimensional composite key to partition sparse data (FIG. 2A, FIG. 2B) into a hypercube like structure (FIG. 1). Only the data structure produced by the method in this invention is actually better than a hypercube since all involved keys can have true symmetric access as opposed to just the keys that have the highest sort order significance. Equivalent query efficiency could only be otherwise obtained through storing multiple copies of the sparse data sorted on different permutations of the member keys of the multidimensional composite key (FIG. 2C). The data structure has two major components: the partitioned data with or without the boundary keys and the non-dense index necessarily containing the boundary keys (FIG. 3). This data structure and partitioning method can be used to partition multidimensional data across physical hardware storage devices and parallel computer architectures (FIG. 4) to produce variable grained data partitions that can be queried, loaded, or updated in parallel and simultaneous multidimensional index selectivity. And finally, as noted above, this same partitioning method can be used in a nested fashion or in combination with other data structures to provide good performance for the batch maintenance of volatile data and special performance advantages for true time-series data.
REFERENCES:
patent: 5226109 (1993-07-01), Dawson et al.
patent: 5495539 (1996-02-01), Sieverding
patent: 5497486 (1996-03-01), Stolfo et al.
patent: 5546499 (1996-08-01), Lynch et al.
patent: 5551027 (1996-08-01), Choy
patent: 5701467 (1997-12-01), Freeston
patent: 5710915 (1998-01-01), McElhiney
patent: 5787422 (1998-07-01), Tukey et al.
patent: 5864857 (1999-01-01), Ohata et al.
patent: 5870768 (1999-02-01), Hekmatpour
patent: 5878424 (1999-03-01), Dooling et al.
patent: 5886700 (1999-03-01), Di Pippo et al.
"Alhorithms for Multidmensional Partitioning of Static Files", Rotem & Selev, Nov. 1988 IEEE Transactions on Software Engineering, pp. 1700-1710.
"Robust and Efficient Spatial Data Structure", ACTA Informatica, Jul. 1992, pp. 335-373.
Polo et al., "Multi-dimensional partitioning for massively parallel database machines", Proceeding, Euromicro Workshop on Parallel and Distributed processing, 1995, Jan. 25-27, 1995, pp. 244-251, ISBN: 0-8186-7031-2.
Alam Shahid
Amsbury Wayne
LandOfFree
Interval-partitioning method for multidimensional data does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Interval-partitioning method for multidimensional data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interval-partitioning method for multidimensional data will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-873643