This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Cautious Transaction Schedulers for Database Concurrency Control
July 1988 (vol. 14 no. 7)
pp. 997-1009

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.

[1] P. A. Bernstein, D. W. Shipman, and S. W. Wong, "Formal aspects of serializability in database concurrency control,"IEEE Trans. Software Eng., vol. SE-5, no. 3, pp. 203-216, May 1979.
[2] G. N. Buckley and A. Silberschatz, "Obtaining progressive protocols for a simple multiversion database model," inProc. 9th Int. Conf. VLDB, Oct./Nov. 1983, pp. 74-80.
[3] M. J. Carey, "The performance of concurrency control algorithms for database management systems," Dep. Comput. Sci., Univ. Wisconsin--Madison, Tech. Rep. 530, 1984.
[4] M. A. Casanova and P. A. Bernstein, "General purpose schedulers for database systems,"Acta Inform., 14, pp. 195-220, 1980.
[5] M. A. Casanova, "The concurrency control problem for database systems," inLecture Notes in Computer Science 116. Berlin: Springer-Verlag, 1981.
[6] K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger, "The notions of consistency and predicate locks in a database system,"Commun. ACM, vol. 19, no. 11, pp. 624-633, Nov. 1976.
[7] T. Ibaraki, T. Kameda, and T. Minoura, "Disjoint-interval topological sort: A useful concept in serializability theory," inProc. 9th Int. Conf. VLDB, Oct./Nov. 1983, pp. 89-91.
[8] T. Ibaraki, T. Kameda, and N. Katoh, "Cautious transaction schedulers for multiversion database systems," Lab. Comput. Commun. Res., Simon Fraser Univ., LCCR Tech. Rep. 86-12, 1986.
[9] T. Ibaraki, T. Kameda, and T. Minoura, "Serializability with constraints,"ACM Trans. Database Syst., vol. 12, pp. 429-452, Sept. 1987.
[10] N. Katoh, T. Ibaraki, and T. Kameda, "Cautious transaction schedulers with admission control,"ACM Trans. Database Syst., vol. 10, no. 2, pp. 205-229, June 1985.
[11] N. Katoh, T. Kameda, and T. Ibaraki, "A cautious scheduler for multi-step transactions,"Algorithmica, vol. 1, pp. 1-26, 1986.
[12] N. Katoh, T. Kameda, and T. Ibaraki, "Efficient implementation of cautious schedulers," Lab. Comput. Commun. Res., Simon Fraser Univ., LCCR Tech. Rep. (to appear), 1988.
[13] H. T. Kung and C. H. Papadimitriou, "An optimal theory of concurrency control for databases," inProc. SIGMOD Int. Conf. Management Data, ACM, 1979, pp. 116-126.
[14] C.H. Papadimitriou, "The serializability of concurrent database updates,"J. ACM, vol. 26, pp. 631-653, Oct. 1979.
[15] C. H. Papadimitriou and P. C. Kanellakis, "On concurrency control by multiple versions,"ACM Trans. Database Syst., Mar. 1984.
[16] R. Sethi, "A model of concurrent database transactions," inProc. 22nd IEEE Symp. Foundation of Computer Science, Oct. 1981, pp. 175-184.
[17] R. Sethi, "Useless actions make a difference: Strict serializability of database updates,"J. ACM, vol. 29, no. 2, pp. 394-403, Apr. 1982.
[18] R. E. Stearns, P. M. I. Lewis, and D. J. Rosenkrantz, "Concurrency control for database systems," inProc. 17th IEEE Symp. Foundations Computer Science, Oct. 1976, pp. 19-32.
[19] M. Yannakakis, "Issues of correctness in database concurrency control by locking," inProc. ACM Symp. Theory of Computing, May 1981, pp. 363-367.

Index Terms:
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
Citation:
T. Ibaraki, T. Kameda, N. Katoh, "Cautious Transaction Schedulers for Database Concurrency Control," IEEE Transactions on Software Engineering, vol. 14, no. 7, pp. 997-1009, July 1988, doi:10.1109/32.42740
Usage of this product signifies your acceptance of the Terms of Use.