Brief Announcement: Concurrent Wait-Free Red-Black Trees

Natarajan, Aravind; Savoie, Lee Hilton; Mittal, Neeraj

doi:10.1007/978-3-642-33651-5_38

“…In [15], the authors use Red-Black trees to explore databases in real time. In [16], Red-Black trees are used as a concurrent data structure in multicore multi-processor systems. Other explorations of Red-Black trees can be found in [17,18].…”

Section: Introductionmentioning

confidence: 99%

Improving the Red-Black tree delete algorithm

Zegour

¹

2023

Preprint

0

View full text Add to dashboard Cite

Today, Red-Black trees are becoming a popular data structure typically used to implement dictionaries, associative arrays, symbol tables within some compilers (C++, Java …) and many other systems. In this paper, we present an improvement of the delete algorithm of this kind of binary search tree. The suggested algorithm appears to be promising as it gives the tree a different coloring while reducing the number of color changes and maintenance operations by a factor of roughly 29% and 11%, respectively. The new coloring favors the presence of red nodes and therefore speeds up the deletion operation. It also saves about 4 % on running time when insert and delete operations are used together while conserving search performance of the standard algorithm.

show abstract

“…In [15], the authors use Red-Black trees to explore databases in real time. In [16], Red-Black trees are used as a concurrent data structure in multi-core multi-processor systems. Other explorations of Red-Black trees can be found in [17,18].…”

Section: Introductionmentioning

confidence: 99%

Improving the Red-Black tree delete algorithm

Zegour

¹

2023

Preprint

0

View full text Add to dashboard Cite

Today, Red-Black trees are becoming a popular data structure typically used to implement dictionaries, associative arrays, symbol tables within some compilers (C++, Java …) and many other systems. In this paper, we present an improvement of the delete algorithm of this kind of binary search tree. The suggested algorithm appears to be promising as it gives the tree a different coloring while reducing the number of color changes and maintenance operations by a factor of roughly 29% and 11%, respectively. The new coloring favors the presence of red nodes and therefore speeds up the deletion operation. It also saves about 4 % on running time when insert and delete operations are used together while conserving search performance of the standard algorithm.

show abstract

“…In [15], the authors use Red-Black trees to explore databases in real time. In [16], Red-Black trees are used as a concurrent data structure in multi-core multi-processor systems.…”

Section: Introductionmentioning

confidence: 99%

Improving the Red-Black tree delete algorithm

Zegour

¹

2022

Preprint

View full text Add to dashboard Cite

Today, Red-Black trees are becoming a popular data structure typically used to implement dictionaries, associative arrays, symbol tables within some compilers (C++, Java …) and many other systems. In this paper, we present an improvement of the delete algorithm of this kind of binary search tree. The proposed algorithm is very promising since it colors differently the tree while reducing color changes by a factor of about 29%. Moreover, the maintenance operations re-establishing Red-Black tree balance properties are reduced by a factor of about 11%. As a consequence, the proposed algorithm saves about 4 % on running time when insert and delete operations are used together while conserving search performance of the standard algorithm.

show abstract

Brief Announcement: Concurrent Wait-Free Red-Black Trees

Cited by 7 publications

References 2 publications

Improving the Red-Black tree delete algorithm

Improving the Red-Black tree delete algorithm

Improving the Red-Black tree delete algorithm

Improving the Red-Black tree delete algorithm

Contact Info

Product

Resources

About