Efficient locking for concurrent operations on B-trees

DOI10.1145/319628.319663zbMath0465.68061OpenAlexW2108179552WikidataQ56039645 ScholiaQ56039645MaRDI QIDQ3917524

Philip L. Lehman, S. Bing Yao

Publication date: 1981

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/319628.319663

zbMATH Keywords

databaseconsistencycorrectnessdata structuresconcurrent algorithmsmultiway search treeslocking protocolsindex organizationsconcurrency controls

Mathematics Subject Classification ID

Searching and sorting (68P10) Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05) Information storage and retrieval of data (68P20) Theory of operating systems (68N25)

Related Items (22)

Concurrency and trie hashing ⋮ Unsafe operations in B-trees ⋮ Amortization results for chromatic search trees, with an application to priority queues ⋮ Concurrent manipulation of expanded AVL trees ⋮ Confluence of processes and systems of objects ⋮ ISB-tree: A new indexing scheme with efficient expected behaviour ⋮ A rigorous analysis of concurrent operations on B-trees ⋮ Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines ⋮ Concurrent operations in linear hashing ⋮ Transaction synchronisation in object bases ⋮ Analyzing the effects of hyperthreading on the performance of data management systems ⋮ Contention-sensitive data structures and algorithms ⋮ 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 ⋮ Public data structures: counters as a special case. ⋮ Concurrent operations in multi-attribute linear hashing ⋮ Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations ⋮ Key factors for improving performance of concurrency control algorithms

This page was built for publication: Efficient locking for concurrent operations on B-trees