This Article 
 Bibliographic References 
 Add to: 
Concurrency Control in Distributed Databases Through Time Intervals and Short-Term Locks
August 1989 (vol. 15 no. 8)
pp. 994-1003

A method for concurrency control in distributed database management systems that increases the level of concurrent execution of transactions, called ordering by serialization numbers (OSN), is proposed. The OSN method works in the certifier model and uses time-interval techniques in conjunction with short-term locks to provide serializability and prevent deadlocks. The scheduler is distributed, and the standard transaction execution policy is assumed, that is, the read and write operations are issued continuously during transaction execution. However, the write operations are copied into the database only when the transaction commits. The amount of concurrency provided by the OSN method is demonstrated by log classification. It is shown that the OSN method provides more concurrency than basic timestamp ordering and two-phase locking methods and handles successfully some logs which cannot be handled by any of the past methods. The complexity analysis of the algorithm indicates that the method works in a reasonable amount of time.

[1] S. Acar (Cetin), "Performance evaluation of concurrency control mechanisms in distributed database systems," M.S. thesis, Dep. Comput. Eng., Middle East Technical Univ., Feb. 1988.
[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] R. Bayer, K. Eldhart, J. Heigert, and A. Reiser, "Dynamic time-stamp allocation and its application to the BEHR method," Technical Univ. Munich, Tech. Rep. TUM 18107, July 1981.
[4] P. A. Berstein, D. W. Shipman, and W. S. Wong, "Formal aspects of serializability in database concurrency control,"IEEE Trans. Software Eng., vol. SE-5, pp. 203-215, May 1979.
[5] P. A. Bernstein and N. Goodman, "Fundamental algorithms for concurrency control in distributed database systems," Computer Corp. America, Tech. Rep., Feb 1980.
[6] P. Bernstein and N. Goodman, "Concurrency Control in Distributed Database Systems,"ACM Computing Surveys, Vol. 13, No. 2, June 1981, pp. 185-221.
[7] P.A. Bernstein and N. Goodman, "A Sophisticate's Introduction to Distributed Database Concurrency Control,"Proc. Eighth Very Large Database Conf., Morgan Kaufmann, Palo Alto, Calif., 1982, pp. 62-76.
[8] P. A. Bernstein and N. Goodman, "Multiversion concurrency control,"ACM Trans. Database Syst., vol. 8, no. 4, pp. 465-483, Dec. 1983.
[9] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[10] M. A. Casanova, "The concurrency control problem for database systems," inLecture Notes in Computer Science 116. Berlin: Springer-Verlag, 1981.
[11] S. Ceri and G. Pelagatti,Distributed Databases: Principles and Systems, McGraw-Hill, New York, 1984.
[12] A. Dogac and U. Halici, "Timestamp transformation method for concurrency control in distributed DBMSs," inProc. 1st Int. Symp. Computer and Information Sciences, Oct. 1986.
[13] 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.
[14] F. P. Genc, "Simulation of computer systems," Ph.D. dissertation, Univ. Manchester, May 1976.
[15] U. Halici, "Contributions to the theory of database concurrency control," Ph.D. dissertation, Dep. of Elec. Electron. Eng., Middle East Technical Univ., Feb. 1988.
[16] U. Halici and A. Dogac, "Multiversion data with time intervals for concurrency control in distributed DBMSs," Dep. Comput. Eng., Middle East Technical Univ., Tech. Rep., June 1986.
[17] U. Halici and A. Dogac, "A new method for concurrency control in distributed DBMSs: Permission test method,"ACM SIGMOD Rec., vol. 16, no. 3, Sept. 1987.
[18] H. T. Kung and J. T. Robinson, "On optimistic methods for concurrency control,"ACM Trans. Database Syst., vol. 6, pp. 213-226, June 1981.
[19] C. Mohan, "Recent and future trends in distributed database management," inNATO ASI Seminar Notes, Turkey, Aug. 1986.
[20] 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.
[21] C.H. Papadimitriou, "The serializability of concurrent database updates,"J. ACM, vol. 26, pp. 631-653, Oct. 1979.
[22] R. H. Thomas, "A solution to the concurrency control problem for multiple copy databases," inProc. 1978 COMPCON Conf., IEEE, New York, 1978.

Index Terms:
concurrent transaction execution; distributed scheduler; distributed databases; concurrency control; distributed database management systems; ordering by serialization numbers; OSN method; certifier model; time-interval techniques; short-term locks; serializability; deadlocks; standard transaction execution policy; concurrency; log classification; timestamp ordering; two-phase locking; complexity analysis; concurrency control; distributed databases
U. Halici, A. Dogac, "Concurrency Control in Distributed Databases Through Time Intervals and Short-Term Locks," IEEE Transactions on Software Engineering, vol. 15, no. 8, pp. 994-1003, Aug. 1989, doi:10.1109/32.31355
Usage of this product signifies your acceptance of the Terms of Use.