Locks with constrained sharing (extended abstract)
- 2 April 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
In this paper, we propose a new mode for locks that permits sharing in a constrained manner. We develop a family of locking protocols, the strictest of which is the two phase locking protocol while the most permissive recognizes all conflict-preserving serializable histories. This is the first locking-based protocol that can recognize the entire class of conflict-preserving serializable histories.Keywords
This publication has 7 references indexed in Scilit:
- A theory of reliability in database systemsJournal of the ACM, 1988
- Serializability by LockingJournal of the ACM, 1984
- Locking Primitives in a Database SystemJournal of the ACM, 1983
- The serializability of concurrent database updatesJournal of the ACM, 1979
- Formal Aspects of Serializability in Database Concurrency ControlIEEE Transactions on Software Engineering, 1979
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976
- Some Deadlock Properties of Computer SystemsACM Computing Surveys, 1972