By Topic

MD-tree: a balanced hierarchical data structure for multidimensional data with highly efficient dynamic characteristics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Nakamura, Y. ; Mitsubishi Electr. Corp., Hyogo, Japan ; Abe, S. ; Ohsawa, Y. ; Sakauchi, M.

A multidimensional data structure, the MD-tree (multidimensional tree), is proposed. The MD-tree is developed by extending the concept of the B-tree to multidimensional data, so that the MD-tree is a height-balanced tree similar to the B-tree and, even its worst-case storage utilization is more than 66.7%. A description is given of the structure of an MD-tree and the results of a series of simulation tests which indicate that the storage utilization is more than 80% in practice and that the retrieval performance and the dynamic characteristics are superior to those of conventional methods

Published in:

Pattern Recognition, 1988., 9th International Conference on

Date of Conference:

14-17 Nov 1988