The CB tree: a practical concurrent self-adjusting search tree

DOI10.1007/s00446-014-0229-0zbMath1320.68041OpenAlexW1994340586MaRDI QIDQ2256968

Yehuda Afek, Adam Morrison, Boris Korenfeld, Robert Endre Tarjan, Haim Kaplan

Publication date: 23 February 2015

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-014-0229-0

zbMATH Keywords

optimistic concurrency controlsplay treeself-adjusting tree

Mathematics Subject Classification ID

Data structures (68P05) Distributed systems (68M14)

Related Items (2)

Zip-zip trees: making zip trees more balanced, biased, compact, or persistent ⋮ Long-lived counters with polylogarithmic amortized step complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concurrency of operations on B-trees
• Biased skip lists
• Randomized search trees
• Two New Kinds of Biased Search Trees
• Amortized Computational Complexity
• Self-adjusting binary search trees
• A Fast Contention-Friendly Binary Search Tree
• CBTree: A Practical Concurrent Self-Adjusting Search Tree
• Max registers, counters, and monotone circuits
• A Simple Optimistic Skiplist Algorithm

This page was built for publication: The CB tree: a practical concurrent self-adjusting search tree