Relaxed balance through standard rotations
We consider binary search trees, where rebalancing transformations need not be connected with updates but may be delayed. For standard AVL tree rebalancing, we prove that even though the rebalancing operations are uncoupled from updates, their total number is bounded by O(Mlog(M + N)), where M is the number of updates to an AVL tree of initial size N. Hence, relaxed balancing of AVL trees comes at no extra cost asymptotically. Furthermore, our scheme differs from most other relaxed balancing schemes in an important aspect: No rebalancing transformation can be done in the wrong direction, i.e., no performed rotation can make the tree less balanced. Moreover, each performed rotation indeed corresponds to a real imbalance situation in the tree.
Our results are important in designing efficient concurrency control strategies for main-memory databases. Main-memory search structures have gained new applications in large embedded systems, such as switching systems for mobile telephones.
KeywordsSearch Tree Height Difference Active Node Mobile Telephone Switching System
Unable to display preview. Download preview PDF.
- 1.G.M.Adel'son-Vels'kii and E.M.Landis, An algorithm for the organisation of information. Soviet Math. Dokl. 3 (1962) 1259–1262.Google Scholar
- 2.A.V.Aho, J.E.Hopcroft and J.D.Ullman, Data structures and algorithms. Addison-Wesley, 1983.Google Scholar
- 3.J.Boyar, R.Fagerberg, and K.S.Larsen, Amortization results for chromatic search trees, with an application to priority queues, Fourth International Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 955 (1994) 270–281.Google Scholar
- 4.J.Boyar, R.Fagerberg, and K.S.Larsen, Amortization results for chromatic search trees, with an application to priority queues, Journal of Computer and System Sciences (to appear).Google Scholar
- 5.J.Boyar and K.S.Larsen, Efficient rebalancing of chromatic search trees. Journal of Computer and System Sciences 49 (1994) 667–682.Google Scholar
- 6.S.Hanke, T.Ottmann, and E.Soisalon-Soininen, Relaxed balanced red-black trees, Algorithms and Complexity, Third Italian Conference, Lecture Notes in Computer Science 1203 (1997) 193–204.Google Scholar
- 7.J.L.W.Kessels, On-the-fly optimization of data structures. Comm. ACM 26 (1983) 895–901.Google Scholar
- 8.K.S.Larsen, AVL trees with relaxed balance. In: Proc. 8th International Parallel Processing Symposium, IEEE Computer Society Press, 1994, pp. 888–893.Google Scholar
- 9.K.S.Larsen and R.Fagerberg, Efficient rebalancing of B-trees with relaxed balance. International Journal of Foundations of Computer Science, 7:2 (1996) 196–202.Google Scholar
- 10.O.Nurmi and E.Soisalon-Soininen, Uncoupling updating and rebalancing in chromatic binary search trees. In: Proc. 10th ACM Symposium on Principles of Database Systems, 1991, pp. 192–198.Google Scholar
- 11.O.Nurmi, E.Soisalon-Soininen and D.Wood, Concurrency control in database structures with relaxed balance. In: Proc. 6th ACM Symposium on Principles of Database Systems, 1987, pp. 170–176.Google Scholar
- 12.T.Ottmann and E.Soisalon-Soininen, Relaxed balancing made simple. Technical Report 71, Institut für Informatik, Universität Freiburg, Germany, 1995.Google Scholar
- 13.E.Soisalon-Soininen and P.Widmayer, Relaxed balancing in search trees. In: Advances in Algorithms, Languages, and Complexity (D.-Z.Du and K.-I.Ko, eds.), Kluwer Academic Publishers, 1997, pp. 267–283.Google Scholar
- 14.R.E.Tarjan, Amortized computational complexity. SIAM J. Alg. Disc. Meth. 6:2 (1985) 306–318.Google Scholar