Deadlock freedom using edge locks
ACM Transactions on Database Systems (TODS)
A locking protocol for resource coordination in distributed databases
ACM Transactions on Database Systems (TODS)
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
Locking Primitives in a Database System
Journal of the ACM (JACM)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Script: A communication abstraction mechanism
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Script: a communication abstraction mechanism
ACM SIGOPS Operating Systems Review
| Hi-index | 0.00 |
Two locking protocols are defined for distributed database systems. One protocol provides deadlock avoidance without the need to roll back transactions. The other allows a useful weakening of the protocol in which only a limited class of easily handled deadlocks may occur. The protocols are capable of handling replicated as well as partitioned data. Like the centralized protocol on which they are based, the protocol of this paper permits locking at multiple granularities and allows collections of locks to be constructed to correspond to an arbitrary collection of database operations. Special provisions are made in the protocol to allow readers, and in particular, readers that touch data at only one site, to execute with less locking overhead than writers. Following the description of the protocol, comparisons are made between the protocol of this paper and other protocols previously published that offer similar features.