Deadlock freedom using edge locks
- 1 December 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 7 (4) , 632-652
- https://doi.org/10.1145/319758.319772
Abstract
We define a series of locking protocols for database systems that all have three main features: freedom from deadlock, multiple granularity, and support for general collections of locking primitives. A rooted directed acyclic graph is used to represent multiple granularities, as in System R. Deadlock freedom is guaranteed by extending the System R protocol to require locks on edges of the graph in addition to the locks required on nodes.Keywords
This publication has 2 references indexed in Scilit:
- Locking Primitives in a Database SystemJournal of the ACM, 1983
- Consistency in Hierarchical Database SystemsJournal of the ACM, 1980