This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Balanced Hierarchical Data Structure for Multidimensional Data with Highly Efficient Dynamic Characteristics
August 1993 (vol. 5 no. 4)
pp. 682-694

A new multidimensional data structure, multidimensional tree (MD-tree), is proposed. The MD-tree is developed by extending the concept of the B-tree to the multidimensional data, so that the MD-tree is a height balanced tree similar to the B-tree. The theoretical worst-case storage utilization is guaranteed to hold more than 66.7% (2/3) of full capacity. The structure of the MD-tree and the algorithms to perform the insertion, deletion, and spatial searching are described. By the series of simulation tests, the performances of the MD-tree and conventional methods are compared. The results indicate that storage utilization is more than 80% in practice, and that retrieval performance and dynamic characteristics are superior to conventional methods.

[1] R. A. Finkel and J. L. Bentley, "Quad trees: A data structure for retrieval on composite keys,"Acta Inform., vol. 4, no. 1, pp. 1-9, 1974.
[2] J. Bentley, "Multidimensional Binary Search Trees Used for Associative Searching,"Comm. ACM, Vol. 18, No. 9, Sept. 1975, pp. 509- 517.
[3] J. T. Robinson, "The k-D-B-tree: A search structure for large multidimensional dynamic indexes," inProc. ACM SIGMOD, 1981, pp. 10-18.
[4] Y. Ohsawa and M. Sakauchi, "The BD-tree--A new N-dimensional data structure with highly efficient dynamic characteristics," inProc. IFIP Conf., Paris, 1983, pp. 539-544.
[5] J. Nieverglt, H. Hinterberger, and K. Sevcik, "The grid file: An adaptable, symmetric multikey file structure,"ACM TODS, Mar. 1984.
[6] K. Hinrichs, "The grid file System: Implementation and case studies for applications," Ph.D. Dissertation No. 7734, ETH, Zurich, 1985.
[7] H. Guttman, "R-trees: A dynamic index structure for spatial searching," inProc. ACM/SIGMOD Conf., 1984, pp. 47-56.
[8] T. Sellis, N. Roussopoulos, and C. Faloutsos, "The R+-tree: A dynamic index for multi-dimensional objects," inProc. VLDB, 1987.
[9] O. Günther, "The design of the cell tree: An object-oriented index structure for geometric databases, "inProc. IEEE 5th Int. Conf. Data Eng., 1989.
[10] D. Lomet and B. Salzberg, "A robust multi-attribute search structure," inProc. 5th Conf. on Data Engineering, 1989, pp. 296-304.
[11] J.A. Orenstein, "Redundancy in spatial databases," inProc. SIGMOD 1989, 1989, pp. 295-305.
[12] N. Bechmann, H.P. Kriegel, R. Schneider, and B. Seeger, "The R*- tree: An efficient and robust access method for points and rectangles," inProc. SIGMOD 1990, 1990, pp. 322-331.
[13] J. L. Bentley and J. H. Friedman, "Data structure for range searching,"ACM Comput. Surveys, vol. 11, no. 4, pp. 397-410, Dec. 1979.
[14] H. Samet,The Design and Analysis of Spatial Data Structures. Reading, MA: Addison-Wesley, 1990.
[15] S. Dandamundi and P. Sorenson, "Algorithms for BD-trees,"Software Practice and Experience, vol. 16, no.12, pp. 1077-1096, Dec. 1986.
[16] D. E. Knuth,The Art of Computer Programming. Reading, MA: Addison-Wesley, 1973.
[17] C. Comer, "The ubiquitousB-trees,"ACM Comput. Surveys, vol. 11, no. 2, pp. 121-136, June 1979.
[18] Y. Nakamura, S. Abe, Y. Ohsawa, and M. Sakauchi, "MD-tree: A balanced hierarchical data structure for multi-dimensional data with highly efficient dynamic characteristics," inProc. 9th ICPR, 1988, pp. 375-378, vol. 1.

Index Terms:
balanced hierarchical data structure; multidimensional data; highly efficient dynamic characteristics; multidimensional tree; B-tree; worst-case storage utilization; insertion; deletion; spatial searching; simulation; retrieval performance; dynamic characteristics; tree data structures
Citation:
Y. Nakamura, S. Abe, Y. Ohsawa, M. Sakauchi, "A Balanced Hierarchical Data Structure for Multidimensional Data with Highly Efficient Dynamic Characteristics," IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 4, pp. 682-694, Aug. 1993, doi:10.1109/69.234779
Usage of this product signifies your acceptance of the Terms of Use.