Abstract
Relaxed balancing has become a commonly used concept in the design of concurrent search tree algorithms. Many different relaxed balancing algorithms have been proposed, especially for red-black trees and AVL-trees, but their performance in concurrent environments is not yet well understood. This paper presents an experimental comparison of the strictly balanced red-black tree and three relaxed balancing algorithms for red-black trees using the simulation of a multi-processor machine.
This is a preview of subscription content, log in via an institution to check access.
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
L. Bougé, J. Gabarró, X. Messeguer, and N. Schabanel. Concurrent rebalancing of AVL trees: A fine-grained approach. In Proceedings of the 3th Annual European Conference on Parallel Processing, pages 321–429. LNCS 1300, 1997.
J. Boyar, R. Fagerberg, and K. Larsen. Amortization results for chromatic search trees, with an application to priority queues. Journal of Computer and System Sciences, 55(3):504–521, 1997.
J. Boyar and K. Larsen. Efficient rebalancing of chromatic search trees. Journal of Computer and System Sciences, 49:667–682, 1994.
C.S. Ellis. Concurrent search in AVL-trees. IEEE Trans. on Computers, C-29(29):811–817, 1980.
J. Gabarró, X. Messeguer, and D. Riu. Concurrent rebalancing on hyperred-black trees. In Proceedings of the 17th Intern. Conference of the Chilean Computer Science Society, pages 93–104. IEEE Computer Society Press, 1997.
L.J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE Symposium on Foundations of Computer Science, pages 8–21, 1978.
S. Hanke. The performance of concurrent red-black tree algorithms. Technical Report 115, Institut für Informatik, Universität Freiburg, Germany, 1998.
S. Hanke, T. Ottmann, and E. Soisalon-Soininen. Relaxed balanced red-black trees. In Proc. 3rd Italian Conference on Algorithms and Complexity, pages 193–204. LNCS 1203, 1997.
T. Johnson and D. Shasha. The performance of current B-tree algorithms. ACM Trans. on Database Systems, 18(1):51–101, March 1993.
K. Larsen. Amortized constant relaxed rebalancing using standard rotations. Acta Informatica, 35(10):859–874, 1998.
L. Malmi. A new method for updating and rebalancing tree-type main memory dictionaries. Nordic Journal of Computing, 3:111–130, 1996.
L. Malmi. On Updating and Balancing Relaxed Balanced Search Trees in Main Memory. PhD thesis, Helsinki University of Technology, 1997.
L. Malmi and E. Soisalon-Soininen. Group updates for relaxed height-balanced trees. In ACM Symposium on the Principles of Database Systems, June 1999.
O. Nurmi and E. Soisalon-Soininen. Chromatic binary search trees: A structure for concurrent rebalancing. Acta Informatica 33, pages 547–557, 1996.
K. Pollari-Malmi, E. Soisalon-Soininen, and T. Ylönen. Concurrency control in B-trees with batch updates. Trans. on Knowledge and Data Engineering, 8(6):975–983, 1996.
N. Sarnak and R.E. Tarjan. Planar point location using persistent search trees. Communications of the ACM, 29:669–679, 1986.
E. Soisalon-Soininen and P. Widmayer. Relaxed balancing in search trees. In D.-Z. Du and K.-I. Ko, editors, Advances in Algorithms, Languages, and Complexity: Essays in Honor of Ronald V. Book. Kluwer Academic Publishers, Dordrecht, 1997.
V. Srinivasan and M.J. Carey. Performance of B-tree concurrency control algorithms. Proc. ACM Intern. Conf. on Management of Data, pages 416–425, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hanke, S. (1999). The Performance of Concurrent Red-Black Tree Algorithms. In: Vitter, J.S., Zaroliagis, C.D. (eds) Algorithm Engineering. WAE 1999. Lecture Notes in Computer Science, vol 1668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48318-7_23
Download citation
DOI: https://doi.org/10.1007/3-540-48318-7_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66427-7
Online ISBN: 978-3-540-48318-2
eBook Packages: Springer Book Archive