The precedence-assignment model for distributed databases concurrency control algorithms

Authors:
C. P. Wang;V. O. K. Li
Affiliations:
Department of Electrical Engineering, University of Southern California, Los Angeles CA;Department of Electrical Engineering, University of Southern California, Los Angeles CA
Venue:
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Year:
1987

Citing 11
Cited 0

Low cost management of replicated data in fault-tolerant distributed systems

ACM Transactions on Computer Systems (TOCS)
Commutable transactions and the time pad synchronization mechanism for distributed systems

IEEE Transactions on Software Engineering
Comments on SDD-1 concurrency control mechanisms

ACM Transactions on Database Systems (TODS)
Distributed deadlock detection algorithm

ACM Transactions on Database Systems (TODS)
A Majority consensus approach to concurrency control for multiple copy databases

ACM Transactions on Database Systems (TODS)
The correctness of concurrency control mechanisms in a system for distributed databases (SDD-1)

ACM Transactions on Database Systems (TODS)
Reliability mechanisms for SDD-1: a system for distributed databases

ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates

Journal of the ACM (JACM)
Concurrency Control in Distributed Database Systems

ACM Computing Surveys (CSUR)
Distributed deadlock detection

ACM Transactions on Computer Systems (TOCS)
Multidimensional Timestamp Protocols for Concurrency Control

Proceedings of the Second International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have developed a unified model, called the precedence-assignment model (PAM), of concurrency control algorithms in distributed database. It is shown that two-phase locking timestamp-ordering and other existing concurrency control algorithms may be modeled by PAM. We have also developed a new concurrency control algorithm under the PAM modeling framework, which is free from deadlocks and transaction restarts. Finally, a unified concurrency control subsystem for precedence-assignment algorithms is developed. By using this subsystem, different transactions may be executed under different concurrency control algorithms simultaneously.