Abstract
We introduce the relaxed k-tree, a search tree with relaxed balance and a height bound, when in balance, of (1 + ε)log2n + 1, for any g > 0. The rebalancing work is amortized O(1/ε) per update. This is the first binary search tree with relaxed balance having a height bound better than c · log2 n for a fixed constant c. In all previous proposals, the constant is at least 1/log2 φ τ; 1.44, where φ is the golden ratio.
As a consequence, we can also define a standard (non-relaxed) k-tree with amortized constant rebalancing per update, which is an improvement over the original definition.
Search engines based on main-memory databases with strongly fluctuating workloads are possible applications for this line of work.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
G. M. Adel’son-Vel’skii and E. M. Landis. An Algorithm for the Organisation of Information. Doklady Akadamii Nauk SSSR, 146:263–266, 1962. In Russian. English translation in Soviet Math. Doklady, 3:1259–1263, 1962.
Joan Boyar, Rolf Fagerberg, and Kim S. Larsen. Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. Journal of Computer and System Sciences, 55(3):504–521, 1997.
Joan F. Boyar and Kim S. Larsen. Efficient Rebalancing of Chromatic Search Trees. Journal of Computer and System Sciences, 49(3):667–682, 1994.
Leo J. Guibas and Robert Sedgewick. A Dichromatic Framework for Balanced Trees. In Proceedings of the 19th Annual IEEE Symposium on the Foundations of Computer Science, pages 8–21, 1978.
Kim S. Larsen. Amortized Constant Relaxed Rebalancing using Standard Rotations. Acta Informatica, 35(10):859–874, 1998.
Kim S. Larsen. AVL Trees with Relaxed Balance. Journal of Computer and System Sciences, 61(3):508–522, 2000.
H. A. Maurer, Th. Ottmann, and H.-W. Six. Implementing Dictionaries using Binary Trees of Very Small Height. Information Processing Letters, 5(1):11–14, 1976.
Otto Nurmi and Eljas Soisalon-Soininen. Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees. In Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 192–198, 1991.
Otto Nurmi and Eljas Soisalon-Soininen. Chromatic Binary Search Trees—A Structure for Concurrent Rebalancing. Acta Informatica, 33(6):547–557, 1996.
Otto Nurmi, Eljas Soisalon-Soininen, and Derick Wood. Relaxed AVL Trees, Main-Memory Databases and Concurrency. International Journal of Computer Mathematics, 62:23–44, 1996.
Neil Sarnak and Robert E. Tarjan. Planar Point Location Using Persistent Search Trees. Communications of the ACM, 29:669–679, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fagerberg, R., Jensen, R.E., Larsen, K.S. (2001). Search Trees with Relaxed Balance and Near-Optimal Height. In: Dehne, F., Sack, JR., Tamassia, R. (eds) Algorithms and Data Structures. WADS 2001. Lecture Notes in Computer Science, vol 2125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44634-6_38
Download citation
DOI: https://doi.org/10.1007/3-540-44634-6_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42423-9
Online ISBN: 978-3-540-44634-7
eBook Packages: Springer Book Archive