The Community for Technology Leaders
Green Image
<p>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.</p>
computational complexity; distributed databases; transaction schedulers; database concurrency control; cautious schedulers; WW; write-write constraints; WRW; WW-scheduler; polynomial-time scheduling algorithm; NP-complete; read sets; write sets; computational complexity; database theory; distributed databases; scheduling

T. Kameda, N. Katoh and T. Ibaraki, "Cautious Transaction Schedulers for Database Concurrency Control," in IEEE Transactions on Software Engineering, vol. 14, no. , pp. 997-1009, 1988.
94 ms
(Ver 3.3 (11022016))