Serializability by Locking

DOI10.1145/62.322425MaRDI QIDQ3768431zbMATH OpenOpenAlexFDO

Authors Mihalis Yannakakis

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

zbMATH Keywords

concurrency controldatabase managementlockingserializabilitytransaction processing

Mathematics Subject Classification ID

Theory of operating systems (68N25) Information storage and retrieval of data (68P20)

Cited in

(10)

• Generalized theory of serializability
• A dynamic majority determination algorithm for reconfiguration of network partitions
• Conceptual level concurrency control of relational update transactions
• Locking based on a pairwise decomposition of the transaction system
• In the search for optimal concurrency
• On serializability
• Serializable graphs
• Commutativity-based locking for nested transactions
• On the power of safe locking
• Algebraic specification of concurrent systems

This page was built for publication: Serializability by Locking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768431)