Abstract
While many tree-like structures have been proven to support amortized constant number of operations after updates, considerably fewer structures have been proven to support the more general exponentially decreasing number of operations with respect to distance from the update. In addition, all existing proofs of exponentially decreasing operations are tailor-made for specific structures. We provide the first formalization of conditions under which amortized constant number of operations imply exponentially decreasing number of operations. Since our proof is constructive, we obtain the constants involved immediately. Moreover, we develop a number of techniques to improve these constants.
Supported by the IST Programme of the EU (ALCOM-FT) and the Danish SNF.
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’skiį 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.
R. Bayer and E. McCreight. Organization and Maintenance of Large Ordered Indexes. Acta Informatica, 1:173–189, 1972.
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.
Paul F. Dietz and Rajeev Raman. Persistence, Amortization and Randomization. In Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, pages 78–88, 1991.
James R. Driscoll, Neil Sarnak, Daniel D. Sleator, and Robert E. Tarjan. Making Data Structures Persistent. Journal of Computer and System Sciences, 38:86–124, 1989.
Scott Huddleston and Kurt Mehlhorn. A New Data Structure for Representing Sorted Lists. Acta Informatica, 17:157–184, 1982.
Lars Jacobsen and Kim S. Larsen. Variants of (a, b)-Trees with Relaxed Balance. International Journal of Foundation of Computer Science. To appear.
Lars Jacobsen and Kim S. Larsen. Complexity of Layered Binary Search Trees with Relaxed Balance. In Seventh Italian Conference on Theoretical Computer Science, 2001. This volume.
Lars Jacobsen, Kim S. Larsen, and Morten N. Nielsen. On the Existence and Construction of Non-Extreme (a, b)-Trees. Tech. rep. 11, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, 2001.
Kim S. Larsen and Rolf Fagerberg. Efficient Rebalancing of B-Trees with Relaxed Balance. International Journal of Foundations of Computer Science, 7(2):169–186, 1996.
Kurt Mehlhorn. Sorting and Searching, volume 1 of Data Structures and Algorithms. Springer-Verlag, 1984.
Kurt Mehlhorn and Athanasios Tsakalidis. An Amortized Analysis of Insertions into AVL-Trees. SIAM Journal on Computing, 15(1), 1986.
Otto Nurmi, Eljas Soisalon-Soininen, and Derick Wood. Concurrency Control in Database Structures with Relaxed Balance. In Proceedings of the 6th ACM Symposium on Principles of Database Systems, pages 170–176, 1987.
Athanasios K. Tsakalidis. Rebalancing Operations for Deletions in AVL-Trees. R.A.I.R.O. Informatique Théorique, 19(4):323–329, 1985.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jacobsen, L., Larsen, K.S. (2001). Exponentially Decreasing Number of Operations in Balanced Trees. In: Theoretical Computer Science. ICTCS 2001. Lecture Notes in Computer Science, vol 2202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45446-2_19
Download citation
DOI: https://doi.org/10.1007/3-540-45446-2_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42672-1
Online ISBN: 978-3-540-45446-5
eBook Packages: Springer Book Archive