Serializability by Locking
From MaRDI portal
Publication:3768431
DOI10.1145/62.322425zbMath0631.68078OpenAlexW2019443158MaRDI QIDQ3768431
Publication date: 1984
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/62.322425
Related Items
A dynamic majority determination algorithm for reconfiguration of network partitions, On serializability, Serializable graphs, On the power of safe locking, Algebraic specification of concurrent systems, Conceptual level concurrency control of relational update transactions, Locking based on a pairwise decomposition of the transaction system, Commutativity-based locking for nested transactions, In the Search for Optimal Concurrency, Generalized theory of serializability