On the Height of Multidimensional Height-Balanced Trees

Authors:
V K Vaishnavi
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1986

Citing 3
Cited 3

Multidimensional B-tree: An Efficient Dynamic File Structure for Exact Match Queries

GI - 10. Jahrestagung
Multidimensional Height-Balanced Trees

IEEE Transactions on Computers
On the Height of Height-Balanced Trees

IEEE Transactions on Computers

Multidimensional Balanced Binary Trees

IEEE Transactions on Computers
A compendium of key search references

ACM SIGIR Forum
Fast algorithms for sorting and searching strings

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	14.98

Visualization

Abstract

It is shown that the worst case height of a k- dimensional height-balanced tree, k = 2, is the same as that of an AVL-tree, to within an additive factor of 2k - 2.