This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Concurrency Control in Database Systems
January/February 1999 (vol. 11 no. 1)
pp. 3-16

Abstract—Ideas that are used in the design, development, and performance of concurrency control mechanisms have been summarized. The locking, time-stamp, optimistic-based mechanisms are included. The ideas of validation in optimistic approach are presented in some detail. The degree of concurrency and classes of serializability for various algorithms have been presented. Questions that relate arrival rate of transactions with degree of concurrency and performance have been briefly presented. Finally, several useful ideas for increasing concurrency have been summarized. They include flexible transactions, adaptability, prewrites, multidimensional timestamps, and relaxation of two-phase locking.

[1] P.A. Bernstein and N. Goodman, "Concurrency Control in Distributed Database Systems," ACM Computing Surveys, Vol. 13, No. 2, June 1981, pp. 185-221.
[2] P.A. Bernstein, N. Goodman, and V. Hadzilacos, Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1986.
[3] P.A. Bernstein, D.W. Shipman, and J.B. Rothnie Jr., "Concurrency Control in a System for Distributed Databases (SDD-1)," Trans. Database Systems, vol. 5, no. 1, pp. 18-51, ACM, 1980.
[4] B. Bhargava, "Performance Evaluation of the Optimistic Concurrency Control Approach to Distributed Database Systems and Its Comparison with Locking," Proc. IEEE Int'l Conf. Distributed Computing Systems, pp. 508-517,Miami, 1982.
[5] B. Bhargava, "Concurrency Control and Reliability in Distributed Database System," Software Eng. Handbook, Van Nostrand Reinhold, pp. 331-358, 1983.
[6] "Concurrency Control and Reliability in Distributed Systems," B. Bhargava, ed., Van Nostrand and Reinhold, 1987.
[7] B. Bhargava and C. Hua, "A Causal Model for Analyzing Distributed Concurrency Control Algorithms," IEEE Trans. Software Eng., vol. 9, pp. 470-486, 1983.
[8] B. Bhargava, "Resilient Concurrency Control in Distributed Database Systems," IEEE Trans. Reliability, vol. 31, no. 5, pp. 437-443, 1984.
[9] B. Bhargava, "Transaction Processing and Consistency Control of Replicated Copies During Failures," J. Management Information Systems, vol. 4, no. 2, pp. 93-112, 1987.
[10] B. Bhargava and J. Riedl, "RAID Distributed Database System," IEEE Trans. Software Eng., vol. 15, no. 6, pp. 726-736, 1989.
[11] B. Bhargava and J. Riedl, "A Formal Model for Adaptable Systems for Transaction Processing," IEEE Trans. Knowledge and Data Eng., vol. 4, no. 1, pp. 433-449, 1989.
[12] S.B. Davidson, "Optimism and Consistency in Partitioned Distributed Database Systems," Trans. Database Systems, vol. 17, no. 3, pp. 456-481, ACM, Sept. 1984.
[13] K.P. Eswaran, J.N. Gray, R.A. Lorie, and I.L. Traiger, "The Notions of Consistency and Predicate Locks in a Relational Database System," Comm. ACM, vol. 8, no. 11, pp. 624-633, 1976.
[14] H. Garcia-Molina, "Performance of Update Algorithms for Replicated Data in a Distributed Database," PhD thesis, Dept. of Computer Science, Stanford Univ., 1979.
[15] J.N. Gray, "Notes on Database Operating Systems" Operating Systems: An Advanced Course, R. Bayer, R.M. Graham, and G. Seegmuller, eds., Lecture Notes in Computer Science 60, Springer-Verlag, Heidelberg, Germany, 1978.
[16] J.N. Gray, "The Transaction Concept: Virtues and Limitations," Proc. VLDB Conf.,Cannes, France, Sept. 1981.
[17] J.N. Gray and A. Reuter, Transaction Processing: Concepts and Techniques, Morgan Kaufmann, San Mateo, Calif., 1993.
[18] H.T. Kung and C.H. Papadimitriou, "An Optimality Theory of Database Concurrency Control," Acta Informatica, vol. 19, no. 1, pp. 1-13, 1984.
[19] H.T. Kung and J.T. Robinson, "On Optimistic Methods for Concurrency Control," ACM Trans. Database Systems, vol. 6, no. 2, pp. 213-226, June 1981.
[20] L. Lamport, "Time, clocks and the ordering of events in a distributed system," Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[21] P.J. Leu and B. Bhargava, “Multidimensional Timestamp Protocols for Concurrency Control,” IEEE Trans. Software Eng., vol. 13, pp. 1238-1253, Dec. 1987.
[22] P. Leu and B. Bhargava, "Clarification of Two Phase Locking in Concurrent Transaction Processing," IEEE Trans. Software Eng., vol. 14, no. 1, pp. 120-123, 1988.
[23] S.K. Madria and B. Bhargava, "System Defined Prewrites to Increase Concurrency in Databases," Proc. First East European Symp. Advances in Databases and Information Systems,St. Petersburg, Russia, ACM-SIGMOD, Sept. 1997.
[24] C. Papadimitriou, "The Serializability of Concurrent Updates," J. ACM, vol. 26, no. 4, pp. 631-653, 1979.
[25] C.H. Papadimitriou, The Theory of Database Concurrency Control, Computer Science Press, 1986.
[26] E. Pitoura and B. Bhargava, “Maintaining Consistency of Data in Mobile Distributed Environments,” Proc. 15th Int'l Conf. Distributed Computing Systems, 1995.
[27] R. Prakash, M. Raynal, and M. Singhal, "An Adaptive Causal Ordering Algorithm Suited to Mobile Computing Environments," J. Parallel and Distributed Computing, pp. 190-204, Mar. 1997.
[28] A. Silberschatz and Z. Kedem, "Consistency in Hierarchical Database Systems," J. ACM, vol. 27, no. 1, pp. 72-80, 1979.
[29] R.H. Thomas, “A Majority Consensus Approach to Concurrency Control,” ACM Trans. Database Systems, vol. 4, no. 2, pp. 180-209, June 1979.
[30] J.D. Ullman, Principles of Database Systems, second ed., Computer Science Press, Potomac, Md., 1982.
[31] A. Zhang and A. Elmagarmid, "A Theory of Global Concurrency Control in Multidatabase Systems," VLDB J., vol. 2, no. 3, pp. 331-359, July 1993.
[32] A. Zhang, M. Nordine, B. Bhargava, and O. Bukhres, "Ensuring Semi-Atomicity for Flexible Transactions in Multi-Database System," Proc. SIGMOD Conf., pp. 67-78,Minneapolis, ACM, May 1994.

Index Terms:
Degree of concurrency, adaptability, time-stamp, optimistic, classes of serializability, performance, flexible transactions.
Citation:
Bharat Bhargava, "Concurrency Control in Database Systems," IEEE Transactions on Knowledge and Data Engineering, vol. 11, no. 1, pp. 3-16, Jan.-Feb. 1999, doi:10.1109/69.755610
Usage of this product signifies your acceptance of the Terms of Use.