Chromatic binary search trees: A structure for concurrent rebalancing

DOI10.1007/s002360050057zbMath0849.68026OpenAlexW4241183800MaRDI QIDQ1901709

Eljas Soisalon-Soininen, Otto Nurmi

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

updatingconcurrencybinary search treesrebalancingchromatic trees

Mathematics Subject Classification ID

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

Related Items (9)

Amortization results for chromatic search trees, with an application to priority queues ⋮ Red-black trees with constant update time ⋮ Relaxed multi-way trees with group updates. ⋮ The amortized analysis of a non-blocking chromatic tree ⋮ Relaxed avl trees, main-memory databases and concurrency ⋮ Skip trees, an alternative data structure to skip lists in a concurrent approach ⋮ AVL trees with relaxed balance ⋮ Unnamed Item ⋮ VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE

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