|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
On the Height of Multidimensional Height-Balanced Trees
September 1986 (vol. 35 no. 9)
pp. 773-780
| ASCII Text | x | ||
| V.K. Vaishnavi, "On the Height of Multidimensional Height-Balanced Trees," IEEE Transactions on Computers, vol. 35, no. 9, pp. 773-780, September, 1986. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1986.1676837, author = {V.K. Vaishnavi}, title = {On the Height of Multidimensional Height-Balanced Trees}, journal ={IEEE Transactions on Computers}, volume = {35}, number = {9}, issn = {0018-9340}, year = {1986}, pages = {773-780}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1986.1676837}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - On the Height of Multidimensional Height-Balanced Trees IS - 9 SN - 0018-9340 SP773 EP780 EPD - 773-780 A1 - V.K. Vaishnavi, PY - 1986 KW - multidimensional height- balanced trees KW - Data structure analysis KW - dynamic databases KW - height-balanced trees KW - information storage and retrieval KW - multidimensional balanced tree structures VL - 35 JA - IEEE Transactions on Computers ER - | |||
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.
Index Terms:
multidimensional height- balanced trees, Data structure analysis, dynamic databases, height-balanced trees, information storage and retrieval, multidimensional balanced tree structures
Citation:
V.K. Vaishnavi, "On the Height of Multidimensional Height-Balanced Trees," IEEE Transactions on Computers, vol. 35, no. 9, pp. 773-780, Sept. 1986, doi:10.1109/TC.1986.1676837
Usage of this product signifies your acceptance of the Terms of Use.