Concurrency control in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates
Journal of the ACM (JACM)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Monitors: an operating system structuring concept
Communications of the ACM
An optimality theory of concurrency control for databases
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
On Concurrency Control by Multiple Versions
ACM Transactions on Database Systems (TODS)
A theorem in database concurrency control
Journal of the ACM (JACM)
On concurrency control by multiple versions
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Is distributed locking harder?
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Basic Timestamp, Multiple Version Timestamp, and Two-Phase Locking
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Issues of correctness in database concurrency control by locking
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We study the expressive power of locking primitives, as measured by ther ability to implement different concurrency control principles. We give a necessary and sufficient condition for a concurrency control principle (abstractly, a set of histories) to be implementable by binary semaphores. Also, we characterize exactly those sets of locking primitives that are no more powerful than binary semaphores.