The group paradigm for concurrency control
- 1 June 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 17 (3) , 126-134
- https://doi.org/10.1145/971701.50216
Abstract
We propose a paradigm for developing, describing and proving the correctness of concurrency control protocols for replicated databases in the presence of failures or communication restrictions. Our approach is to hierarchically divide the problem of achieving one-copy serializability by introducing the notion of a “group” that is a higher level of abstraction than transactions. Instead of dealing with the overall problem of serializing all transactions, our paradigm divides the problem into two simpler ones. (1) A local policy for each group that ensures a total order of all transactions in that group. (2) A global policy that ensures a correct serialization of all groups. We use the paradigm to demonstrate the similarities between several concurrency control protocols by comparing the way they achieve correctness.Keywords
This publication has 12 references indexed in Scilit:
- Dynamic quorum adjustment for partitioned dataACM Transactions on Database Systems, 1987
- Limitations on database availability when networks partitionPublished by Association for Computing Machinery (ACM) ,1986
- Consistency in a partitioned network: a surveyACM Computing Surveys, 1985
- Availability in partitioned replicated databasesPublished by Association for Computing Machinery (ACM) ,1985
- Achieving robustness in distributed database systemsACM Transactions on Database Systems, 1983
- Implementing atomic actions on decentralized dataACM Transactions on Computer Systems, 1983
- The failure and recovery problem for replicated databasesPublished by Association for Computing Machinery (ACM) ,1983
- Concurrency control in a system for distributed databases (SDD-1)ACM Transactions on Database Systems, 1980
- Weighted voting for replicated dataPublished by Association for Computing Machinery (ACM) ,1979
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976