Relaxed avl trees, main-memory databases and concurrency

DOI10.1080/00207169608804523zbMath1001.68509OpenAlexW1968477279WikidataQ126246048 ScholiaQ126246048MaRDI QIDQ2710798

Eljas Soisalon-Soininen, Otto Nurmi, Derick Wood

Publication date: 19 December 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169608804523

zbMATH Keywords

concurrencysearch treesdictionary operationsrelaxed AVL tree

Mathematics Subject Classification ID

Database theory (68P15) Network design and communication in computer systems (68M10)

Related Items (4)

Amortization results for chromatic search trees, with an application to priority queues ⋮ Relaxed multi-way trees with group updates. ⋮ Skip trees, an alternative data structure to skip lists in a concurrent approach ⋮ AVL trees with relaxed balance

Cites Work

• Unnamed Item
• Unnamed Item
• Concurrent operations on \(B^ *\)-trees with overtaking
• Purely top-down updating algorithms for stratified search trees
• Concurrency of operations on B-trees
• Efficient rebalancing of chromatic search trees
• Chromatic binary search trees: A structure for concurrent rebalancing
• Organization and maintenance of large ordered indexes
• On-the-fly optimization of data structures
• Concurrent Search and Insertion in AVL Trees
• List processing in real time on a serial computer
• On-the-fly garbage collection

This page was built for publication: Relaxed avl trees, main-memory databases and concurrency