A New Method for Concurrency in B-Trees

DOI10.1109/TSE.1982.235251MaRDI QIDQ3947132zbMATH OpenOpenAlexFDO

Authors Y. S. Kwong, D. Wood

Publication date 1982

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tse.1982.235251

zbMATH Keywords

concurrent operations in B-treeslock-couplingsearchingside-branching

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cited in

(12)

• Transaction synchronisation in object bases
• Concurrent operations in multi-attribute linear hashing
• Amortization results for chromatic search trees, with an application to priority queues
• Operation-specific locking in balanced structures
• Insertion-safeness in balanced trees
• Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations
• Variants of (a,b)-trees with relaxed balance
• Concurrent operations on \(B^ *\)-trees with overtaking
• A process-calculus analysis of concurrent operations on B-trees
• A rigorous analysis of concurrent operations on B-trees
• Global parallel index for multi-processors database systems
• Integrated concurrency control in shared B-trees

This page was built for publication: A New Method for Concurrency in B-Trees

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