Effects of locking granularity in a database management system
- 1 September 1977
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 2 (3), 233-246
- https://doi.org/10.1145/320557.320566
Abstract
Many database systems guarantee some form of integrity control upon multiple concurrent updates by some form of locking. Some “granule” of the database is chosen as the unit which is individually locked, and a lock management algorithm is used to ensure integrity. Using a simulation model, this paper explores the desired size of a granule. Under a wide variety of seemingly realistic conditions, surprisingly coarse granularity is called for. The paper concludes with some implications of these results concerning the viability of so-called “predicate locking”.Keywords
This publication has 8 references indexed in Scilit:
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976
- The design and implementation of INGRESACM Transactions on Database Systems, 1976
- System RACM Transactions on Database Systems, 1976
- Performance prototyping of data management applicationsPublished by Association for Computing Machinery (ACM) ,1976
- Deadlock detection and resolution in a CODASYL based data management systemPublished by Association for Computing Machinery (ACM) ,1976
- Granularity of locks in a shared data basePublished by Association for Computing Machinery (ACM) ,1975
- Consistency auditing of databasesThe Computer Journal, 1974
- System DeadlocksACM Computing Surveys, 1971