Survey on Concurrency Control Techniques (original) (raw)

IJERT-Analysis of Effectiveness of Concurrency Control Techniques in Databases Ruchi Dagar

International Journal of Engineering Research and Technology (IJERT), 2012

https://www.ijert.org/analysis-of-effectiveness-of-concurrency-control-techniques-in-databases https://www.ijert.org/research/analysis-of-effectiveness-of-concurrency-control-techniques-in-databases-IJERTV1IS5487.pdf There is an ever-increasing demand for more complex transactions and higher throughputs in transaction processing systems leading to higher degrees of transaction concurrency. In this paper, we have analyzed different techniques of concurrency control in distributed databases and compared their performance. 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.

A Review on Concurrency Control Techniques in Database Management Systems

Kafrelsheikh Journal of Information Sciences

Conflicts, deadlock and rolled-back transactions are being considered as the most recent challenges related to executing the transaction concurrently on different environments of Database Management Systems (DBMS). More precisely, in distributed database systems, to handle and avoid these challenges, there are different techniques and protocols are utilized. In this paper, we highlight some of these techniques which includes Two-Phase Commit (2PC) protocol and Three-Phase Commit (3PC) protocol) as well as and Deadlock-Free Cell lock (DFCL) algorithm. Moreover, the paper surveys all these protocols and demonstrate the pros and cons of each techniques. Afterwards, we proposed the solution of some important problems related to concurrency control techniques in DBMS

Comparative Study of Concurrency Control Techniques in Distributed Databases

2014 Fourth International Conference on Communication Systems and Network Technologies, 2014

In today's world many of researches have been done on distributed databases. The main issue in distributed databases is to maintain consistency in databases. To maintain consistency in database, correctness criteria must be met. Many of the concurrency control methods are presented earlier, but they have problems about delay, performance, waiting time and number of message exchanges while maintaining correctness. Our paper presents comparison of the recent concurrency control methods considering the above mentioned parameters.

Study of Concurrency Control Techniques in Distributed DBMS

International Journal of Machine Learning and Networked Collaborative Engineering

Concurrency control focuses on maintaining consistency and integrity of database through synchronized access. The complexity relating to concurrency control in a distributed context is very high as compared to centralized framework due to maintaining consistency within the multiple fragments / copies of the database. This paper consolidates and discusses various lock based concurrency control techniques for Distributed DBMS. The paper also presents a comparative study of various two phase locking based concurrency control techniques.

Concurrency Control in Distributed Database

2020

In a distributed database, uncontrolled concurrent execution of multiple transactions can lead to inconsistencies and can affect data integrity. So, there is requirement of controlling the concurrent execution of the transactions so that the consistency and integrity of the database systems can be ensured. The study presents the new breed of mechanism known as the SC-2PL concurrency control mechanism, which is a mixture of Strict-2PL and Conservative-2PL concurrency control mechanisms. Our proposal improves the performance of the distributed database through the elimination of blockages, cascading aborts and dirty reads and write.

A Survey on Efficient Concurrency Control Algorithm in Distributed Database Systems

International Journal of Scientific Research in Computer Science, Engineering and Information Technology, 2019

Transaction commit protocols help in reaching an agreement among the participating nodes when a transaction has to be committed or aborted. To initiate an agreement each participating node is asked to vote its decision on the operations on its transactional fragment. The participating nodes can decide to either commit or abort an ongoing transaction. In case of a node failure, the active participants take essential steps such as running the termination protocol to preserve database correctness. This paper sought to investigate the current distributed databases commit protocols such as 2PC and 3PC in order to pin-point their shortcomings. For instance, 2PC suffers from blocking of participant site in case of coordinator failure and increased latency due to forced writes of logs. On its part, 3PC suffers more communication overhead due to extra pre-commit phase. Based on these setbacks, an efficient protocol is suggested towards the end of this paper that it believed to address some of the challenges such as blocking and extra message exchange between communicating nodes.

On Analytical Performance Measurement of Concurrency Control Protocols in DBMS

2009

In this paper some commonly used concurrency control protocols have been implemented through simulation. It is well known that the transactions have mainly four properties: atomicity, consistency, isolation and durability, which are known as the ACID properties. The objective of concurrency control is to ensure consistency when a shared database is updated by multiple concurrent transactions. It is also used to increase the database object utilization. Among all the existing concurrency control protocols, standards are locking, two phase locking, graph based protocols, time stamp-based protocol, wait-die scheme and wound-wait scheme. This paper analyze implementation of two phase locking, wait-die and wound-wait schemes. To implement these protocols, a PC based model has been developed first. The outcome of the model is quite satisfactory. The relative performance of those protocols has been compared in terms of utilization. For each protocol a concurrency control manager has been designated which maintains all lock buffers, detects deadlock, and takes necessary action for deadlock recovery. Analyzing the whole experiment it is clear that wait-die scheme and wound-wait scheme protocols show better performance than two phases locking.

Hybridized Concurrency Control Technique for Transaction Processing in Distributed Database System

International Journal of Computer Science and Mobile Computing

Concurrency control has been actively investigated for the past several years and two-phase locking used as a standard solution for transaction processing in a database management system but the system is saturated with conflicts due to frequent rollbacks, long time waiting and blocking, high rate of aborted transactions that leads to deadlock. Hence to solve these problems, this paper presented a hybridized concurrency control technique which combines two phase locking and timestamp ordering. This technique will enhance the performance of the concurrency control techniques for transaction processing in a distributed database management system. This work is developed in ASP.Net using C# programming language as the front end and Microsoft SQL Server 2008 as the back end that is the database. Our result shows that two-phase locking and timestamp ordering is slow, time consuming during execution while our hybridized approach optimizes faster and consumed less time. This approach will give confidence to database administrators when handling concurrency transactions and make them deliver their work timely.