A concurrent B-tree algorithm using a cooperative locking protocol

DOI10.1007/3-540-45073-4_20MaRDI QIDQ4444400zbMATH OpenFDO

Authors Sungchae Lim, Joonseon Ahn, Myoung Ho Kim

Publication date 27 January 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2712/27120253.htm

Mathematics Subject Classification ID

Data structures (68P05) Computing methodologies and applications (68U99)

Recommendations

• A rigorous analysis of concurrent operations on B-trees
• Integrated concurrency control in shared B-trees
• Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations
• Concurrent operations on \(B^ *\)-trees with overtaking
• A process-calculus analysis of concurrent operations on B-trees
• scientific article; zbMATH DE number 934534

Cited in

(11)

• \(B\)-trees with lazy parent split
• Operation-specific locking in balanced structures
• Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations
• Efficient lock-free binary search trees
• A fast contention-friendly binary search tree
• String Processing and Information Retrieval
• High Performance Computing for Computational Science - VECPAR 2004
• scientific article; zbMATH DE number 2241920 (Why is no real title available?)
• Concurrent operations on \(B^ *\)-trees with overtaking
• A rigorous analysis of concurrent operations on B-trees
• Integrated concurrency control in shared B-trees

This page was built for publication: A concurrent \(B\)-tree algorithm using a cooperative locking protocol

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