Operation-specific locking in balanced structures

DOI10.1016/0020-0255(89)90035-2zbMath0681.68026OpenAlexW2092843999MaRDI QIDQ1823659

Alexandros Biliris

Publication date: 1989

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(89)90035-2

zbMATH Keywords

B-treesBalanced structures

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (1)

\(B\)-trees with lazy parent split

Cites Work

• Unnamed Item
• Concurrent search and insertion in 2-3 trees
• Integrated concurrency control in shared B-trees
• B-trees in a system with multiple users
• Concurrency of operations on B-trees
• Organization and maintenance of large ordered indexes
• Locking Protocols
• Multilevel atomicity—a new correctness criterion for database concurrency control
• Beyond two-phase locking
• Concurrent Search and Insertion in AVL Trees
• Quintary trees
• Efficient locking for concurrent operations on B-trees
• A New Method for Concurrency in B-Trees
• The notions of consistency and predicate locks in a database system
• Using semantic knowledge for transaction processing in a distributed database
• Analyzing Concurrency Control Algorithms When User and System Operations Differ

This page was built for publication: Operation-specific locking in balanced structures