A Theory of Safe Locking Policies in Database Systems

DOI10.1145/322326.322333zbMath0488.68071OpenAlexW2069563500MaRDI QIDQ3950003

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

scheduledeadlock avoidanceconcurrencyserializabilitylocking policy

Mathematics Subject Classification ID

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

Related Items (9)

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

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