Cautious transaction schedulers with admission control
ACM Transactions on Database Systems (TODS)
Serializability with constraints
ACM Transactions on Database Systems (TODS)
On Concurrency Control by Multiple Versions
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)
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
Obtaining Progressive Protocols for a Simple Multiversion Database Model
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract)
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
Multiversion Cautious Schedulers for Database Concurrency Control
IEEE Transactions on Software Engineering
Serializability with constraints
ACM Transactions on Database Systems (TODS)
Modeling and exploiting query interactions in database systems
Proceedings of the 17th ACM conference on Information and knowledge management
Interaction-aware scheduling of report-generation workloads
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.01 |
Cautious schedulers, which never resort to rollbacks for the purpose of concurrency control, are investigated. In particular, cautious schedulers for classes WW consisting of schedules serializable under the write-write constraints, and WRW, a superclass of W, are considered. The cautious WW-scheduler has a number of nice properties, one of which is the existence of a polynomial-time scheduling algorithm. Since cautious WRW-scheduling is, in general, NP-complete, some restrictions are introduced which allow polynomial-time scheduling. All of these cautious schedulers are based on the assumption that transaction predeclare their read and write sets on arrival. Anomalies which occur when transaction modify their read sets or write sets during execution are discussed and countermeasures are proposed.