This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multiversion Cautious Schedulers for Database Concurrency Control
March 1990 (vol. 16 no. 3)
pp. 302-315

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.

[1] R. Bayer, H. Heller, and A. Reiser, "Parallelism and recovery in database system,"ACM Trans. Database Syst., vol. 5, pp. 139-156, June 1980.
[2] P. Bernstein and N. Goodman, "Concurrency Control in Distributed Database Systems,"ACM Computing Surveys, Vol. 13, No. 2, June 1981, pp. 185-221.
[3] P. A. Bernstein and N. Goodman, "Multiversion concurrency control,"ACM Trans. Database Syst., vol. 8, no. 4, pp. 465-483, Dec. 1983.
[4] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[5] M. J. Carey and W. A. Muhhana, "The performance of multiversion concurrency control algorithms," Dep. Comput. Sci., Univ. Wisconsin--Madison, Tech. Rep. 550, 1984.
[6] M. J. Carey, "The performance of concurrency control algorithms for database management systems," Dep. Comput. Sci., Univ. Wisconsin-Madison, Tech. Rep. 530, 1984.
[7] M. A. Casanova and P. A. Bernstein, "General purpose schedulers for database systems,"Acta Inform., vol. 14, pp. 195-220, 1980.
[8] M. A. Casanova, "The concurrency control problem for database systems," inLecture Notes in Computer Science 116. Berlin: Springer-Verlag, 1981.
[9] 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.
[10] T. Hadzilacos and C. H. Papadimitriou, "Algorithmic aspects of multiversion concurrency control," inProc. 4th ACM Symp. Principles of Database Sytstems, Portland, Mar. 1985, pp. 96-104.
[11] Honeywell File Management Supervisor, Honeywell Information Syst., Inc., Order No. DB54, 1973.
[12] T. Ibaraki, T. Kameda, and N. Katoh, "Multiversion cautious schedulers for database concurrency control," Lab. Comput. Commun. Res., Simon Fraser Univ., LCCR Tech. Rep. 86-12, 1986.
[13] T. Ibaraki, T. Kameda, and T. Minoura, "Serializability with constraints,"ACM Trans. Database Syst., vol. 12, pp. 429-452, Sept. 1987.
[14] T. Ibaraki and T. Kameda, "Cautious schedulers under incomplete predeclarations" (in Japanese), Dep. Data Eng., IEICE Japan, Tech. Rep., Nov. 1987.
[15] T. Ibaraki, T. Kameda, and N. Katoh, "Cautious transaction schedulers for database concurrency control,"IEEE Trans. Software Eng., vol. 14, no. 7, pp. 997-1009, July 1988.
[16] 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.
[17] N. Katoh, T. Kameda, and T. Ibaraki, "A cautious scheduler for multi-step transactions,"Algorithmica, vol. 1, pp. 1-26, 1986.
[18] N. Katoh, T. Kameda, and T. Ibaraki, "Efficient implementation of cautious schedulers," manuscript, 1988.
[19] 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.
[20] H. T. Kung and J. T. Robinson, "On optimistic methods for concurrency control,"ACM Trans. Database Syst., vol. 6, pp. 213-226, June 1981.
[21] G. Lausen, "Serializability problems of interleaved transactions," inLecture Notes in Computer Science 123; Trends in Information Processing, Berlin: Springer-Verlag, 1981.
[22] S. Nishio, S. Taniguchi, and T. Ibaraki, "On the efficiency of cautious schedulers for database concurrency control--Why insist on two-phase locking?" Dep. Inform. Comput. Sci., Faculty Eng. Sci., Osaka Univ., Tech. Rep. 89002, Feb. 1989.
[23] C.H. Papadimitriou, "The serializability of concurrent database updates,"J. ACM, vol. 26, pp. 631-653, Oct. 1979.
[24] C. H. Papadimitriou, "A theorem in database concurrency control,"J. ACM, vol. 29, no. 4, pp. 998-1006, Oct. 1982.
[25] C. H. Papadimitriou and P. C. Kanellakis, "On concurrency control by multiple versions,"ACM Trans. Database Syst., Mar. 1984.
[26] R. Sethi, "Useless actions make a difference: Strict serializability of database updates,"J. ACM, vol. 29, no. 2, pp. 394-403, Apr. 1982.
[27] R. E. Stearns, P. M. I. Lewis, and D. J. Rosenkrantz, "Concurrency control for database systems," inProc. 17th IEEE Symp. Foundations of Computer Science, Houston, TX, Oct, 1976, pp. 19-32.
[28] C. Sy and T. Kameda, "Simulation study of cautious schedulers," Draft. School Comput. Sci., Simon Fraser Univ., Vancouver, 1986.
[29] C. Sy, "Efficient schedulers in multiversion database systems," M.Sc. thesis, School Comput. Sci., Simon Fraser Univ., Vancouver, 1986.
[30] M. Takeda, S. Masuyama, and T. Ibaraki, "Cautious schedulers with a fixed number of versions" (in Japanese).Trans. IEICE Japan, vol. J70-D, no. 8, pp. 1478-1486, Aug. 1987.
[31] M. Yannakakis, "Issues of correctness in database concurrency control by locking," inProc. ACM Symp. Theory of Computing, May 1981, pp. 363-367.

Index Terms:
database concurrency control; read/write steps; multiversion cautious scheduler; MC; reordering; incoming sequence; rollbacks; read sets; write sets; polynomial time; MWW; MWRW; multiversion classes; logs; write-write; write-read-write constraints; cancellation anomaly; predeclared steps; transactions; read operations; concurrency control; database management systems; scheduling; transaction processing.
Citation:
T. Ibaraki, T. Kameda, N. Katoh, "Multiversion Cautious Schedulers for Database Concurrency Control," IEEE Transactions on Software Engineering, vol. 16, no. 3, pp. 302-315, March 1990, doi:10.1109/32.48938
Usage of this product signifies your acceptance of the Terms of Use.