Locking Primitives in a Database System
- 1 January 1983
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 30 (1) , 55-79
- https://doi.org/10.1145/322358.322363
Abstract
Locking ~s a frequently used concurrency control mechamsm m database systems. Most systems offer one or more lock modes, usually read and write modes. Here, one operatwnal lock mode is assumed for each database operation, and a criterion for "good" lock compatibdlty functions, called maximal permtssiveness, is gtven Operatmnal modes are used as a basis to define generalized update modes that correspond to arbitrary lock conversions. The notion of intention modes from System R is extended to arbnrary lock modes, and the mteractmn among the classes of lock modes thus created is studied.Keywords
This publication has 4 references indexed in Scilit:
- Deadlock freedom using edge locksACM Transactions on Database Systems, 1982
- Consistency in Hierarchical Database SystemsJournal of the ACM, 1980
- AddendumThe Ballarat Naturalist, 1979
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976