A Review of Locking Protocols for Concurrency Control in Parallel Databases

Notice

This is an unedited manuscript accepted for publication and provided as an Article in Press for early access at the author’s request. The article will undergo copyediting, typesetting, and galley proof review before final publication. Please be aware that errors may be identified during production that could affect the content. All legal disclaimers of the journal apply.

Year : 2026 | Volume : 13 | 02 | Page :
    By

    Donga Dhanushya,

  • Manas Kumar Yogi,

  1. Undergraduate Student, Department of Computer Science and Engineering, Pragati Engineering College (A), Surampalem, Andhra Pradesh, India
  2. Assistant Professor, Department of Computer Science and Engineering, Pragati Engineering College (A), Surampalem, Andhra Pradesh, India

Abstract

In modern database systems, many transactions may run at the same time. When several users try to access the same data or update the data simultaneously, then it creates a problem such as inconsistency data, lost updates or misinformation and may lead to conflicts between the transactions and deadlocks. To avoid these types of issues and maintain the correctness of the database, concurrency control protocols are mainly used. This paper reviews different locking-based concurrency control protocols that are used in parallel database systems. This explains how these protocols work and how they help in managing multiple transactions running at the same time. In the beginning, this study describes the main issues in concurrent transaction processing, such as ensuring data consistency and handling deadlocks. After that, it introduces some important locking protocols like Two-Phase Locking (2PL) and its different types. It also involves other advanced protocols like Distributed Two-Phase Locking (D2PL), High Priority Two-Phase Locking (HP2PL), and Two-Phase Locking–Lock Write All (2PL-LW).The review also analyses and compares these protocols based on different factors such as transaction throughput, response time, ability to handle conflicts, and complexity of implementation. The research also discusses different performance evaluation metrics and experimental methods that help researchers understand how effective these protocols are. These methods provide a framework to measure and analyze the performance of various concurrency control techniques. Finally, the paper discusses some future research directions such as decentralized timestamp methods like FairTID, hybrid protocol approaches, and AI-based adaptive concurrency control techniques that can improve the performance of modern parallel and distributed database systems.

Keywords: Locking protocols, Two-phase Locking, Concurrency control, Parallel databases, Transactions, Deadlocks

How to cite this article:
Donga Dhanushya, Manas Kumar Yogi. A Review of Locking Protocols for Concurrency Control in Parallel Databases. Journal of Advanced Database Management & Systems. 2026; 13(02):-.
How to cite this URL:
Donga Dhanushya, Manas Kumar Yogi. A Review of Locking Protocols for Concurrency Control in Parallel Databases. Journal of Advanced Database Management & Systems. 2026; 13(02):-. Available from: https://journals.stmjournals.com/joadms/article=2026/view=245700


References

  1. Shams MY, Abohany A. A Review on Concurrency Control Techniques in Database Management Systems. Kafrelsheikh Journal of Information Sciences. 2022 Jun 1;3(1):1-0.
  2. Cellary W, Morzy T, Gelenbe E. Concurrency control in distributed database systems. Elsevier; 2014 Jun 28.
  3. Nguyen T, Kawashima H. Fairly decentralizing a hybrid concurrency control protocol for real‐time database systems. Concurrency and Computation: Practice and Experience. 2025 Feb 28;37(4-5):e70018.
  4. Chiu A, Kao B, Lam KY. An analysis of lock-based and optimistic concurrency control protocols in multiprocessor real-time databases. Journal of Systems and Software. 1998 Sep 1;42(3):273-86.
  5. Pavan Vadapalli. Lock Based Protocol in DBMS: Types, Working, and Real-Life Examples. upGrad. upgrad; 2024. Available from: https://www.upgrad.com/tutorials/software-engineering/dbms-tutorial/lock-based-protocol-in-dbms/
  6. Lei XD, Yuan XL. Validation concurrency control protocol in parallel real-time database systems. Journal of Central South University of Technology. 2002 Sep;9(3):197-201.
  7. Agrawal R, Carey MJ, Livny M. Models for studying concurrency control performance: Alternatives and implications. ACM SIGMOD Record. 1985 May 1;14(4):108-21.
  8. Bernstein PA, Goodman N. Concurrency control in distributed database systems. ACM Computing Surveys (CSUR). 1981 Jun 1;13(2):185-221.
  9. Bernstein PA, Hadzilacos V, Goodman N. Concurrency control and recovery in database systems. Reading: Addison-wesley; 1987 Jan 1.
  10. Eswaran KP, Gray JN, Lorie RA, Traiger IL. The notions of consistency and predicate locks in a database system. Communications of the ACM. 1976 Nov 1;19(11):624-33.
  11. Hsiao DK. Data base computers. InAdvances in Computers 1980 Jan 1 (Vol. 19, pp. 1-64). Elsevier.
  12. Haritsa JR, Carey MJ, Livny M. On being optimistic about real-time constraints. InProceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems 1990 Apr 2 (pp. 331-343).
  13. Haritsa JR, Carey MJ, Livny M. Dynamic real-time optimistic concurrency control. In[1990] Proceedings 11th Real-Time Systems Symposium 1990 Dec 5 (pp. 94-103). IEEE.
  14. Bernstein PA, Goodman N. Concurrency control in distributed database systems. ACM Computing Surveys (CSUR). 1981 Jun 1;13(2):185-221.
  15. Kanellakis PC, Papadimitriou CH. The complexity of distributed concurrency control. In22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) 1981 Oct 28 (pp. 185-197). IEEE.
  16. Silberschatz A, Korth HF, Sudarshan S. Database system concepts. New York: McGraw-Hill; 2002.
  17. Silberschatz A. A case for non-two-phase locking protocols that ensure atomicity. IEEE Transactions on Software Engineering. 1983 Jul 31(4):535-8.
  18. Hellerstein JM, Stonebraker M, editors. Readings in database systems. MIT press; 2005.
  19. Wolfson O, Yannakakis M. Deadlock-freedom (and saftey) of transactions in a distributed database. InProceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems 1985 Mar 25 (pp. 105-112).
  20. Wolfson O. The overhead of locking (and commit) protocols in distributed databases. ACM Transactions on Database Systems (TODS). 1987 Sep 1;12(3):453-71.
Ahead of Print Subscription Review Article
Volume 13
02
Received 15/03/2026
Accepted 30/03/2026
Published 20/04/2026
Publication Time 36 Days
39

Login


My IP

PlumX Metrics