Concurrency of operations on B-trees
From MaRDI portal
Publication:1232296
DOI10.1007/BF00263762zbMath0343.68022MaRDI QIDQ1232296
Publication date: 1977
Published in: Acta Informatica (Search for Journal in Brave)
Related Items
A process-calculus analysis of concurrent operations on B-trees, Concurrent operations on \(B^ *\)-trees with overtaking, \(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half, Global parallel index for multi-processors database systems, Commutativity-based locking for nested transactions, Concurrent operations in linear hashing, Shifting timestamps for concurrency control in an information hierarchy, On the average number of rebalancing operations in weight-balanced trees, Transaction synchronisation in object bases, Concurrent operations in multi-attribute linear hashing, Operation-specific locking in balanced structures, Insertion-safeness in balanced trees, Public data structures: counters as a special case., Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations, Relaxed avl trees, main-memory databases and concurrency, Unnamed Item