Exponentially decreasing number of operations in balanced trees
- 43 Downloads
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.
KeywordsInformation System Operating System Data Structure Communication Network Information Theory
Unable to display preview. Download preview PDF.
- 1.Adel'son-Vel'skii, G.M., Landis, E.M.: 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
- 2.Andersson, A., Fagerberg, R., Larsen, K.S.: Balanced binary search trees. In: Dinesh P. Mehta, Sartaj Sahni (eds.), Handbook of Data Structures and Applications, Chapman & Hall/CRC Computer & Information Science Series, pp. 10–1–10–28. CRC Press (2005)Google Scholar
- 3.Dietz, P.F., Raman, R.: Persistence, amortization and randomization. In: Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp 78–88, (1991)Google Scholar
- 6.Jacobsen, L.: Search trees with local rules. PhD thesis, Department of Mathematics and Computer Science, University of Southern Denmark (2001)Google Scholar
- 7.Jacobsen, L., Larsen, K.S., Nielsen, M.N.: On the existence and construction of non-extreme \((a,b)\)-trees. Information Processing Letters, 84(2), 69–73 (2002)Google Scholar
- 9.Mehlhorn, K.: Sorting and Searching, vol. 1 of Data Structures and Algorithms. Springer-Verlag (1984)Google Scholar
- 11.Overmars, M. H.: Searching in the past ii: general transforms. Technical Report RUU-CS-81-9. Department of Computer Science, University of Utrecht, The Netherlands (1981)Google Scholar
- 12.Raman, R.: Eliminating amortization: on data structures with guaranteed response time. PhD thesis, Department of Computer Science, University of Rochester, Rochester, New York (1992)Google Scholar
- 13.Sarnak, N.: Persistent data structures. PhD thesis, Department of Computer Science, New York University, New York (1986)Google Scholar