Concurrency of operations on B-trees
From MaRDI portal
Publication:1232296
DOI10.1007/BF00263762zbMath0343.68022OpenAlexW1980806195MaRDI QIDQ1232296
Publication date: 1977
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00263762
Related Items (22)
Unnamed Item ⋮ Unnamed Item ⋮ Shifting timestamps for concurrency control in an information hierarchy ⋮ \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores ⋮ A rigorous analysis of concurrent operations on B-trees ⋮ On the average number of rebalancing operations in weight-balanced trees ⋮ Concurrent operations in linear hashing ⋮ Relaxed avl trees, main-memory databases and concurrency ⋮ Compact and localized distributed data structures ⋮ Transaction synchronisation in object bases ⋮ \(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half ⋮ Contention-sensitive data structures and algorithms ⋮ The CB tree: a practical concurrent self-adjusting search tree ⋮ 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 ⋮ Commutativity-based locking for nested transactions ⋮ Operation-specific locking in balanced structures ⋮ Insertion-safeness in balanced trees ⋮ 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
This page was built for publication: Concurrency of operations on B-trees
