Cautious transaction schedulers with admission control
ACM Transactions on Database Systems (TODS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Cautious Transaction Schedulers for Database Concurrency Control
IEEE Transactions on Software Engineering
Serializability with constraints
ACM Transactions on Database Systems (TODS)
On Concurrency Control by Multiple Versions
ACM Transactions on Database Systems (TODS)
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
Multiversion concurrency control—theory and algorithms
ACM Transactions on Database Systems (TODS)
Parallelism and recovery in database systems
ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates
Journal of the ACM (JACM)
Useless Actions Make a Difference: Strict Serializability of Database Updates
Journal of the ACM (JACM)
A theorem in database concurrency control
Journal of the ACM (JACM)
Algorithmic aspects of multiversion concurrency control
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
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
Concurrency Control Problem for Database Systems
Concurrency Control Problem for Database Systems
An optimality theory of concurrency control for databases
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Serializability Problems of Interleaved Database Transactions
Proceedings of the 3rd Conference of the European Cooperation in Informatics on Trends in Information Processing Systems
Issues of correctness in database concurrency control by locking
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
On concurrent execution of information systems applications
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
| Hi-index | 0.00 |
Let MC stand for a class of logs (i.e. sequences of read/write steps of transactions) that are serializable when multiple versions of the data items are maintained. The multiversion cautious scheduler, MCS(MC) which is introduced, outputs a sequence belonging to MC by reordering, if necessary, the incoming sequence of requests from transactions and it never resorts to rollbacks. In the model, transactions on arrival predeclare their read sets and write sets. It is shown that MCS(MWW) and MCS(MWRW) can be executed in polynomial time, where MWW and MWRW are multiversion classes of logs serializable under the write-write and write-read-write constraints respectively. For any multiversion class MC of interest, MCS(MC) does not exhibit cancellation anomaly, i.e. it functions correctly even if some of the predeclared steps are canceled. Furthermore, MCS(MWW) functions correctly, even if transactions issue more read operations than they predeclared. Thus, MCS(MWW) allows each transaction to predeclare only its write set.