Abstract
Relaxed balancing means that, in a dictionary stored as a balanced tree, the necessary rebalancing after updates may be delayed. This is in contrast to strict balancing meaning that rebalancing is performed immediately after the update. Relaxed balancing is important for efficiency in highly dynamic applications where updates can occur in bursts. The rebalancing tasks can be performed gradually after all urgent updates, allowing the concurrent use of the dictionary even though the underlying tree structure is not completely in balance. In this paper we propose a new scheme of how to make known rebalancing techniques relaxed in an efficient way. The idea is applied to the red-black trees, but can be applied to any class of balanced trees. The key idea is to accumulate insertions and deletions such that they can be settled in arbitrary order using the same rebalancing operations as for standard balanced search trees. As a result it can be shown that the number of needed rebalancing operations known from the strict balancing scheme carry over to relaxed balancing.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Adel'son-Vels'kii, G.M, Landis, E.M.: ”An algorithm for the organisation of information”; Soviet Math. Dokl., 3 (1962), 1259–1262.
Bayer, R., McCreight, E.: ”Organization and maintenance of large ordered indexes”; Acta Informatica, 1 (1972), 173–189.
Boyar, J., Fagerberg, R., Larsen, K.: ”Amortization Results for Chromatic Search Trees, with an Application to Priority Queues”; 4th International Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, 955 (1995), 270–281.
Boyar, J., Fagerberg, R., Larsen, K.: ”Chromatic priority queues”; Preprint 15, Department of Mathematics and Computer Science, Odense University (1994).
Boyar, J., Larsen, K.: ”Efficient rebalancing of chromatic search trees”; Journal of Computer and System Sciences, 49 (1994), 667–682.
Ellis, C.S.: ”Concurrent search in AVL-trees”; IEEE Transactions on Computers, C-29 (1980), 811–817.
Ellis, C.S.: ”Concurrent search and insertions in 2–3 trees”; Acta Informatica, 14 (1980), 63–86.
Guibas, L.J., Sedgewick, R.: ”A dichromatic framework for balanced trees”; Proc. 19th IEEE Symposium on Foundations of Computer Science, (1978), 8–21.
Keller, A., Wiederhold, G.: ”Concurrent use of B-trees with variable-length entries”; SIGMOD Record, 17, 2 (1988), 89–90.
Kessels, J.L.W.: ”On-the-fly optimization of data structures”; Comm. ACM, 26 (1983), 895–901.
Larsen, K.: ”AVL trees with relaxed balance”; Proc. 8th International Parallel Processing Symposium, IEEE Computer Society Press, (1994), 888–893.
Larsen, K., Fagerberg, R.: ”B-trees with relaxed balance”; Proc. 9th International Parallel Processing Symposium, IEEE Computer Society Press, (1995), 196–202.
Nurmi, O., Soisalon-Soininen, E.: ”Chromatic binary search trees: A structure for concurrent rebalancing”; Acta Informatica 33 (1996), 547–557.
Nurmi, O., Soisalon-Soininen, E., Wood, D.: ”Concurrency control in database structures with relaxed balance”; Proc. 6th ACM Symposium on Principles of Database Systems, (1987), 170–176.
Olivié,H.J.: ”A new class of balanced search trees: half-balanced binary search trees”; R.A.I.R.O. Theoretical Informatics, 16, 1 (1982), 51–71.
Ottmann, Th., Soisalon-Soininen, E.: ”Relaxed Balancing Made Simple”; Techn. Report 71, Institut für Informatik, Universität Freiburg, Germany (1995), also appeared as electronic version, anonymous FTP ftp.informatik.uni-freiburg.de, in /documents/reports/report71/, also http://hyperg.informatik.uni-freiburg.de/Report71.
Ottmann, Th., Wood, D.: ”Updating binary trees with constant linkage cost”; International Journal of Foundations of Computer Science, 3, (1992), 479–501.
Sagiv, Y.: ”Concurrent operations on B*-trees with overtaking”; Journal of Computer and System Sciences, 33, 2 (1986), 275–296.
Sarnak, N., Tarjan, R.E.: ”Planar point location using persistent search trees”; Comm. ACM, 29 (1986), 669–679.
Shasha, D., Goodman, N.: ”Concurrent search structure algorithms”; ACM Transaction on Database Systems, 13, (1988), 53–90.
Soisalon-Soininen, E., Widmayer, P.: ”Relaxed balancing in search trees”; Advances in Algorithms, Languages, and Complexity: Essays in Honor of Ronald V. Book (eds. D.-Z.Du and K.-I. Ko), Kluwer Academic Publishers, Dordrecht (1997). To appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hanke, S., Ottmann, T., Soisalon-Soininen, E. (1997). Relaxed balanced red-black trees. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds) Algorithms and Complexity. CIAC 1997. Lecture Notes in Computer Science, vol 1203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62592-5_72
Download citation
DOI: https://doi.org/10.1007/3-540-62592-5_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62592-6
Online ISBN: 978-3-540-68323-0
eBook Packages: Springer Book Archive