Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Limitations on database availability when networks partition
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Availability in partitioned replicated databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
Achieving robustness in distributed database systems
ACM Transactions on Database Systems (TODS)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Concurrency control in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Implementing atomic actions on decentralized data
ACM Transactions on Computer Systems (TOCS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
Increasing availability in partitioned database systems
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
The failure and recovery problem for replicated databases
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A paradigm for concurrency control protocols for distributed databases
A paradigm for concurrency control protocols for distributed databases
Concurrency control in advanced database applications
ACM Computing Surveys (CSUR)
A flexible hybrid concurrency control model for collaborative applications in large scale settings
EW 7 Proceedings of the 7th workshop on ACM SIGOPS European workshop: Systems support for worldwide applications
| Hi-index | 0.00 |
The authors 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. The approach used 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, the paradigm breaks it into two simpler ones: (1) a local policy for each group that ensures a total order of all transactions in that group; and (2) a global policy that ensures a correct serialization of all groups. The paradigm is used to demonstrate the similarities between several concurrency control protocols by comparing the way they achieve correctness.