On optimistic methods for concurrency control
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
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
Concurrency control for database systems
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
The HiPAC project: combining active databases and timing constraints
ACM SIGMOD Record - Special Issue on Real-Time Database Systems
Cautious Transaction Schedulers for Database Concurrency Control
IEEE Transactions on Software Engineering
Multiversion Cautious Schedulers for Database Concurrency Control
IEEE Transactions on Software Engineering
A non-blocking transaction data flow graph based approach for replicated data
ACM SIGOPS Operating Systems Review
Serializability with constraints
ACM Transactions on Database Systems (TODS)
The Performance of an Efficient Distributed Synchronization and Recovery Algorithm
The Journal of Supercomputing
A Nonblocking Transaction Data Flow Graph Based Protocol For Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
Asynchronous Transaction Processing for Updates by Client: With Elimination of Wait-for State
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Asynchronous Operations in Distributed Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Non-blocking concurrency control in distributed database systems
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
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.00 |
We propose a new class of schedulers, called cautious schedulers, that grant an input request if it will not necessitate any rollback in the future. In particular, we investigate cautious WRW-schedulers that output schedules in class WRW only. Class WRW consists of all schedules that are serializable, while preserving the write-read and read-write conflict, and is the largest polynomially recognizable subclass of serializable schedules currently known. It is shown, in this paper however, that cautious WRW-scheduling is, in general, NP-complete. Therefore, we introduce a special type (type 1R) of transaction, which consists of no more than one read step (an indivisible set of read operations) followed by multiple write steps. It is shown that cautious WRW-scheduling can be performed efficiently if all transactions are of type 1R and if admission control can be exercised. Admission control rejects a transaction unless its first request is immediately grantable.