The Community for Technology Leaders
Green Image
<p>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.</p>
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
Y. Ohsawa, M. Sakauchi, Y. Nakamura, S. Abe, "A Balanced Hierarchical Data Structure for Multidimensional Data with Highly Efficient Dynamic Characteristics", IEEE Transactions on Knowledge & Data Engineering, vol. 5, no. , pp. 682-694, August 1993, doi:10.1109/69.234779
95 ms
(Ver 3.3 (11022016))