Performance evaluation of attribute-based tree organization
ACM Transactions on Database Systems (TODS)
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
Multi-attribute retrieval with combined indexes
Communications of the ACM
Weighted Multidimensional B-trees Used as Nearly Optimal Dynamic Dictionaries
Proceedings on Mathematical Foundations of Computer Science
Dynamic k-Dimensional Multiway Search under Time-Varying Access Frequencies
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Multidimensional B-tree: An Efficient Dynamic File Structure for Exact Match Queries
GI - 10. Jahrestagung
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Dynamic weighted data structures
Dynamic weighted data structures
ACM SIGACT News
IEEE Transactions on Computers
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
IEEE Transactions on Computers
Analysis of the Multiple-Attribute-Tree Data-Base Organization
IEEE Transactions on Software Engineering
A dichromatic framework for balanced trees
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
On the Height of Height-Balanced Trees
IEEE Transactions on Computers
On the Height of Multidimensional Height-Balanced Trees
IEEE Transactions on Computers
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Search data structures for skewed strings
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
| Hi-index | 14.98 |
A new multidimensional balanced tree structure is presented for the efficient management of multidimensional data. It is shown that the data structure can be used to manage a set of n k-dimensional records or data items such that the records can be searched or updated in O(log2 n) + k time, which is optimal. The data structure is a multidimensional generalization of the height-balanced trees and retains much of their simplicity and efficiency. The insertion algorithm, in particular, retains a very important property of the height-balanced trees: an insertion of a record results in the application of a restructuring operation at most once.