Data structures and network algorithms
Data structures and network algorithms
Making data structures persistent
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
On the Height of Multidimensional Height-Balanced Trees
IEEE Transactions on Computers
SIAM Journal on Computing
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
ACM SIGACT News
A compendium of key search references
ACM SIGIR Forum
The on-line d-dimensional dictionary problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
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
Human motion database with a binary tree and node transition graphs
Autonomous Robots
| Hi-index | 14.98 |
A new balanced multidimensional tree structure called a k-dimensional balanced binary tree, where k is a positive integer, is presented and integrated. It is shown that the data structure can be used to manage a set of n k-dimensional data items such that access, insertion, and deletion operations can be supported in O(log n+k) time. The data structure is a multidimensional generalization of a balanced binary tree and retains much of the simplicity and efficiency of the base structure. The data structure requires O(k) single rotations for each insertion or deletion operation.