research-article

On the Height of Multidimensional Height-Balanced Trees

Author:

V K VaishnaviAuthors Info & Claims

IEEE Transactions on Computers, Volume 35, Issue 9

Pages 773 - 780

https://doi.org/10.1109/TC.1986.1676837

Published: 01 September 1986 Publication History

Publisher Site

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.

References

[1]

R. H. Gueting and H. P. Kriegel, "Multidimensional B-tree: An efficient dynamic file structure for exact match queries," in Proc. 10th GI Ann. Conf., 1980, pp. 375-388.

Digital Library

Google Scholar

[2]

F. Luccio and L. Pagli, "On the height of height-balanced trees," IEEE Trans. Comput., vol. C-25, pp. 87-90, 1976.

Digital Library

Google Scholar

[3]

E. M. Reingold and W. J. Hansen, Data Structures. Boston, MA: Little Brown, 1983.

Google Scholar

[4]

V. K. Vaishnavi, "Multidimensional height-balanced trees," IEEE Trans. Comput., vol. C-33, pp. 334-343, 1984.

Digital Library

Google Scholar

[5]

V. K. Vaishnavi, "Weighted leaf AVL-trees," Dep. Comput. Inform. Syst., Georgia State Univ., Atlanta, Tech. Rep. 24, 1985.

Google Scholar

Cited By

View all

Bentley JSedgewick RSaks M(1997)Fast algorithms for sorting and searching stringsProceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms10.5555/314161.314321(360-369)Online publication date: 5-Jan-1997
https://dl.acm.org/doi/10.5555/314161.314321
Vaishnavi VKorson T(1991)Height-analysis ofk-dimensional leaf and node height-balanced trees: A new approachBIT10.1007/BF0195278131:1(36-49)Online publication date: 1-Mar-1991
https://dl.acm.org/doi/10.1007/BF01952781
Aoe J(1990)A compendium of key search referencesACM SIGIR Forum10.1145/101306.10130824:3(26-42)Online publication date: 1-Nov-1990
https://dl.acm.org/doi/10.1145/101306.101308
Show More Cited By

Index Terms

On the Height of Multidimensional Height-Balanced Trees

Recommendations

Multidimensional Height-Balanced Trees

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 ...
Read More
Embedding certain height-balanced trees and complete pm-ary trees into hypercubes

A height-balanced tree is a rooted binary tree T in which for every vertex v@?V(T), the heights of the left and right subtrees of v, differ by at most one. In this paper, we embed two subclasses of height-balanced trees into hypercubes with unit ...
Read More
Rebalancing Height Balanced Trees

A new balancing technique for binary search trees is presented, based on the repositioning of k + 1 nodes (k-rotation) Some properties of k-rotation are shown, and bounds to k are derived. The performance of such a technique is discussed on the basis of ...
Read More

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 35, Issue 9

September 1986

85 pages

ISSN:0018-9340

Editor:
Steven L Tanimoto

Issue’s Table of Contents

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 September 1986

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bentley JSedgewick RSaks M(1997)Fast algorithms for sorting and searching stringsProceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms10.5555/314161.314321(360-369)Online publication date: 5-Jan-1997
https://dl.acm.org/doi/10.5555/314161.314321
Vaishnavi VKorson T(1991)Height-analysis ofk-dimensional leaf and node height-balanced trees: A new approachBIT10.1007/BF0195278131:1(36-49)Online publication date: 1-Mar-1991
https://dl.acm.org/doi/10.1007/BF01952781
Aoe J(1990)A compendium of key search referencesACM SIGIR Forum10.1145/101306.10130824:3(26-42)Online publication date: 1-Nov-1990
https://dl.acm.org/doi/10.1145/101306.101308
Vaishnavi V(1989)Multidimensional Balanced Binary TreesIEEE Transactions on Computers10.1109/12.3084938:7(968-985)Online publication date: 1-Jul-1989
https://dl.acm.org/doi/10.1109/12.30849

Abstract

References

Cited By

Index Terms

Recommendations

Multidimensional Height-Balanced Trees

Embedding certain height-balanced trees and complete pm-ary trees into hypercubes

Rebalancing Height Balanced Trees

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations