A New Method for Concurrency in B-Trees

DOI10.1109/TSE.1982.235251zbMath0486.68057OpenAlexW2057391254MaRDI QIDQ3947132

Y. S. Kwong, Derick 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

searchingside-branchinglock-couplingconcurrent operations in B-trees

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (12)

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

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