This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
G-Tree: A New Data Structure for Organizing Multidimensional Data
April 1994 (vol. 6 no. 2)
pp. 341-347

The author describes an efficient data structure called the G-tree (or grid tree) for organizing multidimensional data. The data structure combines the features of grids and B-trees in a novel manner. It also exploits an ordering property that numbers the partitions in such a way that partitions that are spatially close to one another in a multidimensional space are also close in terms of their partition numbers. This structure adapts well to dynamic data spaces with a high frequency of insertions and deletions, and to nonuniform distributions of data. We demonstrate that it is possible to perform insertion, retrieval, and deletion operations, and to run various range queries efficiently using this structure. A comparison with the BD tree, zkdb tree and the KDB tree is carried out, and the advantages of the G-tree over the other structures are discussed. The simulated bucket utilization rates for the G-tree are also reported.

[1] J. Bentley, "Multidimensional Binary Search Trees Used for Associative Searching,"Comm. ACM, Vol. 18, No. 9, Sept. 1975, pp. 509- 517.
[2] W. Burkhard, "Interpolation-based index maintenance,"BIT, vol. 23, no. 3, pp. 274-294, 1983.
[3] C. Comer, "The ubiquitousB-trees,"ACM Comput. Surveys, vol. 11, no. 2, pp. 121-136, June 1979.
[4] S. Dandamundi and P. Sorenson, "An empirical performance comparison of some variations of the k-d tree and BD tree,"Int. J. Comput. Inform. Sci., vol. 14, no. 3, pp. 135-159, June 1985.
[5] S. Dandamundi and P. Sorenson, "Algorithms for BD-trees,"Software Practice and Experience, vol. 16, no.12, pp. 1077-1096, Dec. 1986.
[6] M. Freeston, "The bang file: A new kind of grid file," inProc. ACM SIGMOD Int. Conf. Management Data, May 1987, pp. 260-269.
[7] K. Hinrichs, "Implementation of the grid file: Design concepts and experience,"BIT, vol. 25, no. 4, K., pp. 569-592, 1985.
[8] J. Nieverglt, H. Hinterberger, and K. Sevcik, "The grid file: An adaptable, symmetric multikey file structure,"ACM TODS, Mar. 1984.
[9] J. A. Orenstein and T. H. Merrett, "A class of data structures for associative searching," inProc. SIGACT-SIGMOD, Waterloo, Ont., Canada, Apr. 2-4, 1984, pp. 181-190.
[10] J. Orenstein, "Spatial query processing in an object-oriented database system," inProc. ACM SIGMOD Conf., Washington, DC, May 1986, pp. 326-336.
[11] M. Ouksel and P. Scheuerman, "Storage mapping for multidimensional linear dynamic hashing,"PODS '83, pp. 90-105, Mar. 1983.
[12] J. T. Robinson, "The k-D-B-tree: A search structure for large multidimensional dynamic indexes," inProc. ACM SIGMOD, 1981, pp. 10-18.
[13] J. B. Rothnie and T. Lozano, "Attribute based file organization in a paged memory environment,"Commun. ACM, vol. 17, pp. 63-69, Feb. 1974.
[14] H. Samet,The Design and Analysis of Spatial Data Structures. Reading, MA: Addison-Wesley, 1990.

Index Terms:
tree data structures; trees (mathematics); data handling; G-tree; data structure; multidimensional data organisation; grid tree; B-trees; ordering property; multidimensional space; partition numbers; dynamic data spaces; nonuniform data distributions; deletion operations; range queries; BD tree; zkdb tree; KDB tree; simulated bucket utilization rates
Citation:
A. Kumar, "G-Tree: A New Data Structure for Organizing Multidimensional Data," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 2, pp. 341-347, April 1994, doi:10.1109/69.277778
Usage of this product signifies your acceptance of the Terms of Use.