An improved algorithm for database concurrency control

Concurrency is an effective solution for some of the database problems. As, in database systems, transactions’ conflict is a negative factor that effects on the system performance. Concurrency can be considered a positive solution for this problem, if it is applied under some constraints. This paper proposes an enhancement algorithm of two-phase locking to reduce the transactions’ conflict and achieve deadlock free locking namely deadlock-free cell lock algorithm. Our proposal is based on the reduction of locking level of the data to the smallest restricted point. Also, it is proposed to eliminate deadlock problem of the locking algorithms via forcing the waiting transaction to pass into the rollback or the commit phase. Our proposed algorithm improves the performance of the database and the transactions.

[1]  Ayman El-Sayed,et al.  Survey on Concurrency Control Techniques , 2016 .

[2]  C. Mohan.  An Efficient Method for Performing Record Deletions and Updates Using Index Scans , 2002, VLDB.

[3]  Daniel J. Abadi,et al.  Lightweight Locking for Main Memory Database Systems , 2012, Proc. VLDB Endow..

[4]  Gail E. Kaiser,et al.  Concurrency control in advanced database applications , 1991, CSUR.

[5]  Sudipta Sengupta,et al.  Multi-Version Range Concurrency Control in Deuteronomy , 2015, Proc. VLDB Endow..

[6]  Srinivas Devadas,et al.  TicToc: Time Traveling Optimistic Concurrency Control , 2016, SIGMOD Conference.

[7]  Zafar Imam,et al.  An Efficient Approach Concurrency Control in Database Management System: A Performance Analysis , 2013 .

[8]  Samuel Kaspi,et al.  Performance Analysis of Concurrency Control Mechanisms for OLTP Databases , 2014 .

[9]  Sonal kanungo,et al.  Analysis and Comparison of Concurrency Control Techniques , 2015 .

[10]  Md. Anisur Rahman.  An Efficient Concurrency Control Technique for Mobile Database Environment , 2013 .

[11]  Kenneth A. Ross,et al.  Reducing Database Locking Contention Through Multi-version Concurrency , 2014, Proc. VLDB Endow..

[12]  Amir Shaikhha,et al.  Transaction Repair for Multi-Version Concurrency Control , 2017, SIGMOD Conference.

[13]  Ippokratis Pandis,et al.  Efficiently making (almost) any concurrency control mechanism serializable , 2016, The VLDB Journal.

[14]  Michael J. Carey,et al.  The performance of multiversion concurrency control algorithms , 1986, TOCS.

[15]  Hossam S. Hassanein,et al.  Implementation and modeling of two-phase locking concurrency controla performance study , 2000, Inf. Softw. Technol..

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

[17]  Mohamed F. Mokbel,et al.  Locking Key Ranges with Unbundled Transaction Services , 2009, Proc. VLDB Endow..

[18]  Daniel J. Abadi,et al.  Rethinking serializable multiversion concurrency control , 2014, Proc. VLDB Endow..

[19]  Sonal Kanungo,et al.  Comparison of Concurrency Control and Deadlock Handing in Different OODBMS , 2016 .

[20]  Bharat K. Bhargava,et al.  Concurrency Control in Database Systems , 2019, IEEE Trans. Knowl. Data Eng..

[21]  Daniel J. Abadi,et al.  Low overhead concurrency control for partitioned main memory databases , 2010, SIGMOD Conference.

[22]  H. Nakazato,et al.  Timestamp Based Optimistic Concurrency Control , 2005, TENCON 2005 - 2005 IEEE Region 10 Conference.

[23]  Abraham Silberschatz,et al.  Database System Concepts , 1980 .