A Theory of Safe Locking Policies in Database Systems

DOI10.1145/322326.322333MaRDI QIDQ3950003zbMATH OpenOpenAlexFDO

Authors Mihalis Yannakakis

Publication date 1982

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322326.322333

zbMATH Keywords

concurrencydeadlock avoidancelocking policyscheduleserializability

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Information storage and retrieval of data (68P20)

Cited in

(9)

• Is distributed locking harder?
• Deleting completed transactions
• On-line multiversion database concurrency control
• Locking based on a pairwise decomposition of the transaction system
• Safe locking policies for dynamic databases
• Dynamic maintenance of the transitive closure in disjunctive graphs
• Deadlock-freedom (and safety) of transactions in a distributed database
• On the power of safe locking
• Dynamic maintenance of directed hypergraphs

This page was built for publication: A Theory of Safe Locking Policies in Database Systems

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