Relaxed avl trees, main-memory databases and concurrency

DOI10.1080/00207169608804523zbMath1001.68509MaRDI QIDQ2710798

Eljas Soisalon-Soininen, Derick Wood, Otto Nurmi

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

concurrency; search trees; dictionary operations; relaxed AVL tree

Mathematics Subject Classification ID

68P15: Database theory

68M10: Network design and communication in computer systems

Related Items

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

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