Software—Practice & Experience
Redundancy in spatial databases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
The design and analysis of spatial data structures
The design and analysis of spatial data structures
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching
Communications of the ACM
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Robust Multi-Attribute Search Structure
Proceedings of the Fifth International Conference on Data Engineering
The Design of the Cell Tree: An Object-Oriented Index Structure for Geometric Databases
Proceedings of the Fifth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Dynamic maintenance of multidimensional range data partitioning for parallel data processing
Proceedings of the 1st ACM international workshop on Data warehousing and OLAP
Four Promising Multimedia Databases and Their Embodiments
Multimedia Tools and Applications
A Region Splitting Strategy for Physical Database Design of Multidimensional File Organizations
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Astronomical Tables, 2-D Indexing, and Fuzzy-joins
SSDBM '96 Proceedings of the Eighth International Conference on Scientific and Statistical Database Management
Simplifying decision trees: A survey
The Knowledge Engineering Review
An Efficient Mining and Clustering Algorithm for Interactive Walk-Through Traversal Patterns
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
An extended MD-tree with internal leaf for efficient management of moving objects
Journal of Computational Methods in Sciences and Engineering
Lookahead and pathology in decision tree induction
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
PrefixUnion: mining traversal patterns efficiently in virtual environments
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
An improvement algorithm for accessing patterns through clustering in interactive VRML environments
PCM'04 Proceedings of the 5th Pacific Rim conference on Advances in Multimedia Information Processing - Volume Part III
| Hi-index | 0.00 |
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.