Speculative locking protocols to improve performance for distributed database systems

We have proposed speculative locking (SL) protocols to improve the performance of distributed database systems (DDBSs) by trading extra processing resources. In SL, a transaction releases the lock on the data object whenever it produces corresponding after-image during its execution. By accessing both before and after-images, the waiting transaction carries out speculative executions and retains one execution based on the termination (commit or abort) mode of the preceding transactions. By carrying out multiple executions for a transaction, SL increases parallelism without violating serializability criteria. Under the naive version of SL, the number of speculative executions of the transaction explodes with data contention. By exploiting the fact that a submitted transaction is more likely to commit than abort, we propose the SL variants that process transactions efficiently by significantly reducing the number of speculative executions. The simulation results indicate that even with manageable extra resources, these variants significantly improve the performance over two-phase locking in the DDBS environments where transactions spend longer time for processing and transaction-aborts occur frequently.

[1]  Ahmed E. Kamal,et al.  High-speed local area networks and their performance: a survey , 1991, CSUR.

[2]  Y. C. Tay,et al.  Locking performance in centralized databases , 1985, TODS.

[3]  Miron Livny,et al.  Parallelism and concurrency control performance in distributed database machines , 1989, SIGMOD '89.

[4]  Philip A. Bernstein,et al.  Categories and Subject Descriptors: H.2.4 [Database Management]: Systems. , 2022 .

[5]  Patrick Valduriez,et al.  Transaction chopping: algorithms and performance studies , 1995, TODS.

[6]  H. V. Jagadish,et al.  Proclamation-Based Model for Cooperating Transactions , 1992, VLDB.

[7]  B. R. Badrinath,et al.  Semantics-based concurrency control: Beyond commutativity , 1987, 1987 IEEE Third International Conference on Data Engineering.

[8]  Divyakant Agrawal,et al.  The Performance of Protocols Based on Locks with Ordered Sharing , 1994, IEEE Trans. Knowl. Data Eng..

[9]  Philip S. Yu,et al.  Divergence control for epsilon-serializability , 1992, [1992] Eighth International Conference on Data Engineering.

[10]  Irving L. Traiger,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.

[11]  Azer Bestavros,et al.  Value-cognizant Speculative Concurrency Control for Real-Time Databases , 1996, Inf. Syst..

[12]  Dale Skeen,et al.  Nonblocking commit protocols , 1981, SIGMOD '81.

[13]  Alan Jay Smith,et al.  Analysis of locking behavior in three real database systems , 1997, The VLDB Journal.

[14]  J. T. Robinson,et al.  On optimistic methods for concurrency control , 1979, TODS.

[15]  Bruce G. Lindsay,et al.  Transaction management in the R* distributed database management system , 1986, TODS.

[16]  RamamrithamKrithi,et al.  Semantics-based concurrency control , 1992 .

[17]  Hector Garcia-Molina,et al.  Altruistic locking , 1994, TODS.

[18]  Philip S. Yu,et al.  Buffer Analysis for a Data Sharing Environment with Skewed Data Access , 1994, IEEE Trans. Knowl. Data Eng..

[19]  Masaru Kitsuregawa,et al.  Speculation based nested locking protocol to increase the concurrency of nested transactions , 2000, Proceedings 2000 International Database Engineering and Applications Symposium (Cat. No.PR00789).

[20]  Alok N. Choudhary.  Cost of distributed deadlock detection: a performance study , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[21]  Chilukuri K. Mohan.  Performance of Concurrency Control Mechanisms in Centralized Database Systems , 1995 .

[22]  Peter Thanisch,et al.  Branching Transactions: A Transaction Model for Parallel Database Systems , 1994, BNCOD.

[23]  H. Chandler.  Database , 1985 .

[24]  Alexander Thomasian,et al.  Concurrency control for high contention environments , 1992, TODS.

[25]  Jim Gray,et al.  Benchmark Handbook: For Database and Transaction Processing Systems , 1992 .

[26]  Ahmed K. Elmagarmid,et al.  A survey of distributed deadlock detection algorithms , 1986, SGMD.

[27]  W AbeysundaraBandula,et al.  High-speed local area networks and their performance , 1991 .

[28]  Darrell D. E. Long,et al.  ACCESSING REPLICATED DATA IN AN INTERNETWORK , 1990 .

[29]  Masaru Kitsuregawa,et al.  Speculative Lock Management to Increase Concurrency in Mobile Environments , 1999, MDA.

[30]  Jayant R. Haritsa,et al.  Revisiting commit processing in distributed database systems , 1997, SIGMOD '97.

[31]  Jim Gray,et al.  Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.

[32]  Andreas Reuter,et al.  Transaction Processing: Concepts and Techniques , 1992 .

[33]  Azer Bestavros.  Speculative Algorithms for Concurrency Control in Responsive Databases , 1995, Responsive Computer Systems.

[34]  Miron Livny,et al.  Concurrency control performance modeling: alternatives and implications , 1987, TODS.

[35]  Masaru Kitsuregawa,et al.  Improving Performance in Distributed Database Systems Using Speculative Transaction Processing , 1998 .

[36]  Bharat K. Bhargava,et al.  A Study of Distributed Transaction Processing in an Internetwork , 1995, CISMOD.

[37]  Edgar Knapp,et al.  Deadlock detection in distributed databases , 1987, CSUR.

[38]  Azer Bestavros,et al.  Value-cognizant Speculative Concurrency Control , 1995, VLDB.

[39]  Peter M. Spiro,et al.  Designing an Optimized Transaction Committ Protocol , 1991, Digit. Tech. J..

[40]  C. Mohan,et al.  ARIES/IM: an efficient and high concurrency index management method using write-ahead logging , 1992, SIGMOD '92.