Commutativity-based locking for nested transactions

DOI10.1016/0022-0000(90)90034-IzbMath0716.68028MaRDI QIDQ753480

Michael Merritt, Alan Fekete, Nancy A. Lynch, William E. Weihl

Publication date: 1990

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

concurrency controlnested transactionstransaction-processing algorithms

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20)

Related Items (4)

Multi-granularity locking for nested transactions: A proof using a possibilities mapping ⋮ Hybrid concurrency control for abstract data types ⋮ Hybrid atomicity for nested transactions ⋮ Virtual partition algorithm in a nested transaction environment and its correctness

Cites Work

• Unnamed Item
• Unnamed Item
• The impact of recovery on concurrency control
• Concurrency of operations on B-trees
• Necessary and sufficient conditions for R-graph synthesis
• Multiversion concurrency control—theory and algorithms
• On Concurrency Control by Multiple Versions
• Serializability by Locking
• Commutativity-based concurrency control for abstract data types
• A model for concurrency in nested transactions systems
• The serializability of concurrent database updates
• Locking Primitives in a Database System
• The notions of consistency and predicate locks in a database system
• A theory of reliability in database systems

This page was built for publication: Commutativity-based locking for nested transactions