Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations

DOI10.1016/S0020-0255(02)00261-XzbMath1033.68553OpenAlexW2092147036MaRDI QIDQ1857041

Myoung Ho Kim, Sungchae Lim

Publication date: 11 February 2003

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(02)00261-x

zbMATH Keywords

concurrency controlbottom-up tree restructuringconcurrent B-trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Computing methodologies and applications (68U99) Data structures (68P05)

Cites Work

• Unnamed Item
• Concurrent operations on \(B^ *\)-trees with overtaking
• Concurrency of operations on B-trees
• Efficient locking for concurrent operations on B-trees
• A New Method for Concurrency in B-Trees
• Concurrent search structure algorithms

This page was built for publication: Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations