Exponentially Decreasing Number of Operations in Balanced Trees
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.
KeywordsSearch Tree Internal Node Local Rule Layer Function Balance Tree
Unable to display preview. Download preview PDF.
- 1.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.Google Scholar
- 4.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.Google Scholar
- 7.Lars Jacobsen and Kim S. Larsen. Variants of (a, b)-Trees with Relaxed Balance. International Journal of Foundation of Computer Science. To appear.Google Scholar
- 8.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.Google Scholar
- 9.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.Google Scholar
- 11.Kurt Mehlhorn. Sorting and Searching, volume 1 of Data Structures and Algorithms. Springer-Verlag, 1984.Google Scholar
- 12.Kurt Mehlhorn and Athanasios Tsakalidis. An Amortized Analysis of Insertions into AVL-Trees. SIAM Journal on Computing, 15(1), 1986.Google Scholar
- 13.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.Google Scholar