This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Optimistic Locking Technique for Concurrency Control in Distributed Databases
July 1991 (vol. 17 no. 7)
pp. 712-724

A method called optimistic method with dummy locks (ODL) is suggested for concurrency control in distributed databases. It is shown that by using long-term dummy locks, the need for the information about the write sets of validated transactions is eliminated and, during the validation test, only the related sites are checked. The transactions to be aborted are immediately recognized before the validation test, reducing the costs of restarts. Usual read and write locks are used as short-term locks during the validation test. The use of short-term locks in the optimistic approach eliminates the need for the system-wide critical section and results in a distributed and parallel validation test. The performance of ODL is compared with strict two-phase locking (2PL) through simulation, and it is found out that for the low conflict cases they perform almost the same, but for the high conflicting cases, ODL performs better than strict 2PL.

[1] R. Agrawal and D. J. DeWitt, "Integrated concurrency control and recovery mechanisms: Design and performance evaluation,"ACM Trans. Database Syst., vol. 10, pp. 529-564, Dec. 1985.
[2] R. Agrawal, M. J. Carey, and M. Linvy, "Concurrency control performance modelling: Alternatives and implications,"ACM Trans. Database Syst., vol. 12, pp. 609-654, Dec. 1987.
[3] D. Z. Badal, "Correctness of concurrency control and implication in distributed databases," inProc. COMPSAC '79, 1979.
[4] R. Bayer, K. Eldhart, J. Heigert, and A. Reiser, "Dynamic timestamp allocation and its application to the BEHR method," Tech. Univ. Munich, Tech. Rep. TUM 18107, July 1981.
[5] P. A. Bernstein and N. Goodman, "Fundamental algorithms for concurrency control in distributed database systems," Computer Corp. of America, Tech. Rep., Feb. 1980.
[6] P. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems. Reading, MA: Addison-Wesley, 1986.
[7] C. Boksenbaum, M. Cart, J. Ferrie, and J. F. Pans, "Concurrent certifications by intervals of time stamps in distributed database systems,"IEEE Trans. Software Eng., vol. SE-13, pp. 409-419, Apr. 1987.
[8] M. J. Carey and M. Livny, "Distributed concurrency control performance: A study of algorithms, distribution, and replication," inProc. 14th Int. Conf. Very Large Data Bases, 1988.
[9] M. Carey and M. Linvy, "Parallelism and concurrency control performance in distributed database machines," inProc. SIGMOD Int. Conf. Management of Data, 1989.
[10] W. Cellary, E. Gelenbe, and T. Morzy,Concurrency Control in Distributed Database Systems. Amsterdam:North Holland, 1988.
[11] S. Ceri and S. Owicki, "On the use of optimistic methods for concurrency control in distributed databases," inProc. 6th Berkeley Workshop on Distributed Data Management and Computer Networks, 1982.
[12] S. Ceri and G. Pelagatti,Distributed Databases: Principles and Systems, McGraw-Hill, New York, 1984.
[13] K. M. Chandy, J. Misra, and L. M. Haas, "Distributed deadlock detection,"ACM Trans. Comput. Syst., vol. 1, no. 2, pp. 144-156, May 1983.
[14] A. Dogac and U. Halici, "Timestamp transformation method for concurrency control in distributed DBMSs," inProc. Bilkent Symp. Computer and Information Sciences, 1986.
[15] 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.
[16] P. Franaszek and J. T. Robinson, "Limitations on concurrency in transaction processing,"ACM Trans. Database Systems, vol. 10, Mar. 1985.
[17] J. Gray, "Notes on database operation systems," inOperating Systems: An Advanced Course(Lecture Notes in Computer Science, vol. 60) Berlin: Springer-Verlag, 1978.
[18] U. Halici, "Contributions to the theory of database concurrency control," Ph.D. dissertation, Dep. Electrical and Electronics Eng., Middle East Tech. Univ., Ankara, Turkey, Feb. 1988.
[19] U. Halici and A. Dogac, "Serializability of a set with a given ordering constraint and serializability criteria for concurrency control in database systems as constraints on transaction sets," Dep. Electrical and Electronics Eng., Middle East Tech. Univ., Ankara, Turkey, Tech. Rep. TR 87 4, Sept. 1987.
[20] U. Halici and A. Dogac, "A new method for concurrency control in distributed DBMSs: Permission test method,"ACM SIGMOD Record, vol. 16, Sept. 1987.
[21] U. Halici and A. Dogac, "Class HD covers class WRW," , Dep. Electrical and Electronics Eng., Middle East Tech. Univ., Ankara, Tech. Rep. TR 87 6, Nov. 1987.
[22] U. Halici and A. Dogac, "Concurrency control in distributed databases through time intervals and short term locks,"IEEE Trans. Software Eng., vol. 15, pp. 994-1003, Aug. 1989.
[23] T. Hearder, "Observations on optimistic concurrency control schemes,"Inform. Syst., vol. 9, pp. 111-120, 1984.
[24] R. C. Holt, "Some deadlock properties of computer systems,"ACM Comput. Surveys, vol. 4, no. 3, pp. 179-196, Sept. 1972.
[25] T. Ibaraki, T. Kameda, and T. Minoura, "Serializability with constraints,"ACM Trans. Database Syst., vol. 12, pp. 429-452, Sept. 1987.
[26] H. T. Kung and J. T. Robinson, "On optimistic methods for concurrency control,"ACM Trans. Database Syst., vol. 6, pp. 213-226, June 1981.
[27] D. A. Menasce and T. Nakanishi, "Optimistic versus pessimistic concurrency control mechanism in database management systems,"Inform. Syst., vol. 7, pp. 13-27, 1982.
[28] C. Mohan, D. Haderle, B. Lindsay, H. Pirahesh, and P. Schwarz, "ARIES: A Transaction Recover Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging," IBM RJ 6649, Jan. 1989.
[29] C. Mohan, B. Lindsay, and R. Obermarck, "Transaction management in the R*distributed database management system,"ACM Trans. Database Syst., vol. 11, Dec. 1986.
[30] R. Obermarck, "Distributed deadlock detection algorithm,"ACM Trans. Database Syst., vol. 7, June 1982.
[31] T. Ozsu, "Modelling and analysis of distributed database concurrency algorithms using an extended petri formalism,"IEEE Trans. Software Eng., vol. SE-11, pp. 1225-1239, Oct. 1985.
[32] C.H. Papadimitriou, "The serializability of concurrent database updates,"J. ACM, vol. 26, pp. 631-653, Oct. 1979.
[33] C.H. Papadimitriou,The Theory of Database Concurrency Control. Rockville, MD: Computer Science Press, 1986.
[34] D.J. Rosenkrantz, R.E. Stearns, and P.M. Lewis, II, "System level concurrency control for distributed database systems,"ACM Trans. Database Syst., vol. 3, pp. 178-198, June 1978.
[35] B. Schlageter, "Optimistic methods for concurrency control in distributed database systems," inProc. Int. Conf. Very Large Databases, pp. 125-130, Sept. 1981.
[36] K. M. Sinha, P. D. Nandikar, and S. L. Mehndiratta, "Timestamp based certification schemes for transactions in distributed database systems," inProc. ACM SIGMOD Int. Conf. Management of Data, pp. 402-411, 1985.
[37] M. Stonebreaker, "Concurrency control and consistency of multiple copies of data in distributed INGRES,"IEEE Trans Software Eng., vol. SE-5, May 1979.
[38] M. Sungur, K. Tuzer, and U. Halici, "Performance evaluation of database concurrency control techniques through simulation," Dep. Electrical and Electronics Eng., Middle East Tech. Univ., Ankara, Turkey, Tech. Rep. TR-90-1, Jan. 1990.
[39] R. Thomas, "A majority consensus approach to concurrency control,"ACM Trans. Database Syst., vol. 4, pp. 180-209, June 1979.

Index Terms:
optimistic locking technique; concurrency control; distributed databases; optimistic method; dummy locks; write sets; validated transactions; validation test; short-term locks; ODL; strict two-phase locking; low conflict cases; strict 2PL; concurr
Citation:
U. Halici, A. Dogac, "An Optimistic Locking Technique for Concurrency Control in Distributed Databases," IEEE Transactions on Software Engineering, vol. 17, no. 7, pp. 712-724, July 1991, doi:10.1109/32.83907
Usage of this product signifies your acceptance of the Terms of Use.