The theory of database concurrency control
The theory of database concurrency control
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Principles of distributed database systems
Principles of distributed database systems
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Parallelism and recovery in database systems
ACM Transactions on Database Systems (TODS)
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Hi-index | 0.00 |
Two new concurrency control algorithms are introduced for partially replicated distributed databases. They both maintain two values of a data item, and differ in that one requires all locks to be granted at one time, whereas the other does not. They are based on locking, and avoid deadlocks by using timestamps to establish an execution order when conflicts arise. Since they both proceed without any communication among schedulers, but only communication between the originating site and all participating sites, we say they are fully distributed.