A Theory of Safe Locking Policies in Database Systems
From MaRDI portal
Publication:3950003
DOI10.1145/322326.322333zbMATH Open0488.68071OpenAlexW2069563500MaRDI QIDQ3950003FDOQ3950003
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
Information storage and retrieval of data (68P20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)
Cited In (9)
- Dynamic maintenance of directed hypergraphs
- Safe locking policies for dynamic databases
- Deleting completed transactions
- Dynamic maintenance of the transitive closure in disjunctive graphs
- Deadlock-freedom (and safety) of transactions in a distributed database
- Is distributed locking harder?
- On the power of safe locking
- On-line multiversion database concurrency control
- Locking based on a pairwise decomposition of the transaction system
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)
