Concurrency control in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
A locking protocol for resource coordination in distributed databases
ACM Transactions on Database Systems (TODS)
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
Consistency in Hierarchical Database Systems
Journal of the ACM (JACM)
A Theory of Safe Locking Policies in Database Systems
Journal of the ACM (JACM)
A theorem in database concurrency control
Journal of the ACM (JACM)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Deadlock-freedom (and saftey) of transactions in a distributed database
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
A Sophisticate's Introduction to Distributed Concurrency Control (Invited Paper)
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Freedom from deadlock of locked transactions in a distributed database
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We examine the problem of determining whether a set of locked transactions, accessing a distributed database, is guaranteed to produce only serializable schedules. For a pair of transactions we prove that this concurrency control problem (which is polynomially solvable for centralized databases) is in general coNP-complete. We employ a new graph-theoretic technique and provide an efficient test for the special case of databases distributed between two sites only.