Chromatic binary search trees: A structure for concurrent rebalancing

DOI10.1007/S002360050057MaRDI QIDQ1901709zbMATH OpenOpenAlexFDO

Authors Otto Nurmi, Eljas Soisalon-Soininen

Publication date 19 November 1995

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002360050057

zbMATH Keywords

concurrencyrebalancingupdatingbinary search treeschromatic trees

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Database theory (68P15)

Recommendations

• Efficient rebalancing of chromatic search trees
• Amortization results for chromatic search trees, with an application to priority queues
• Amortization results for chromatic search trees, with an application to priority queues
• scientific article; zbMATH DE number 1008516
• EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE

Cited in

(13)

• Amortization results for chromatic search trees, with an application to priority queues
• Efficient rebalancing of chromatic search trees
• scientific article; zbMATH DE number 7561436 (Why is no real title available?)
• Amortization results for chromatic search trees, with an application to priority queues
• Relaxed multi-way trees with group updates.
• Variants of \((a,b)\)-trees with relaxed balance
• Relaxed avl trees, main-memory databases and concurrency
• Red-black trees with constant update time
• A fast contention-friendly binary search tree
• Skip trees, an alternative data structure to skip lists in a concurrent approach
• scientific article; zbMATH DE number 1760035 (Why is no real title available?)
• AVL trees with relaxed balance
• The amortized analysis of a non-blocking chromatic tree

This page was built for publication: Chromatic binary search trees: A structure for concurrent rebalancing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901709)