Practical concurrent binary search trees via logical ordering

  title={Practical concurrent binary search trees via logical ordering},
  author={Dana Drachsler and Martin T. Vechev and Eran Yahav},
We present practical, concurrent binary search tree (BST) algorithms that explicitly maintain logical ordering information in the data structure, permitting clean separation from its physical tree layout. We capture logical ordering using intervals, with the property that an item belongs to the tree if and only if the item is an endpoint of some interval. We are thus able to construct efficient, synchronization-free and intuitive lookup operations. We present (i) a concurrent non-balanced BST… CONTINUE READING
Highly Cited
This paper has 58 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 40 extracted citations

FatCBST: Concurrent Binary Search Tree with Fatnodes

2017 IEEE 19th International Conference on High Performance Computing and Communications; IEEE 15th International Conference on Smart City; IEEE 3rd International Conference on Data Science and Systems (HPCC/SmartCity/DSS) • 2017
View 8 Excerpts
Highly Influenced

A contention adapting approach to concurrent ordered sets

J. Parallel Distrib. Comput. • 2018
View 4 Excerpts
Highly Influenced

Getting to the Root of Concurrent Binary Search Tree Performance

USENIX Annual Technical Conference • 2018
View 4 Excerpts
Highly Influenced

RCU-HTM: Combining RCU with HTM to Implement Highly Efficient Concurrent Binary Search Trees

2017 26th International Conference on Parallel Architectures and Compilation Techniques (PACT) • 2017
View 4 Excerpts
Highly Influenced

Contention Adapting Search Trees

2015 14th International Symposium on Parallel and Distributed Computing • 2015
View 4 Excerpts
Highly Influenced

58 Citations

Citations per Year
Semantic Scholar estimates that this publication has 58 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-9 of 9 references

A Contention-Friendly Binary Search Tree

View 9 Excerpts
Highly Influenced

A lock-free B+tree

View 4 Excerpts
Highly Influenced

Practical lock-freedom

View 3 Excerpts
Highly Influenced

AND SCHA- BANEL, N. Height-relaxed avl rebalancing: A unified, finegrained approach to concurrent dictionaries

View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…