Skip to main content
Log in

An improved algorithm for database concurrency control

  • Original Research
  • Published:
International Journal of Information Technology Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Kanungo S, Morena R (2015) Comparison of concurrency control and deadlock handing in different OODBMS. Int J Adv Res Comput Commun Eng 4(3):245–251

    Article  Google Scholar 

  2. Kanungo S, Morena R (2017) Issues with concurrency control techniques. Int J Electr Electron Comput Sci Eng 1–6

  3. Gohil J, Dolia P (2016) Study and comparative analysis of basic pessimistic and optimistic concurrency control methods for database management system. Int J Adv Res Comput Commun Eng 5(1):178–186

    Google Scholar 

  4. Kaspi S, Venkatraman S (2014) Performance analysis of concurrency control mechanisms for OLTP databases. Int J Inf Educ Technol 4(4):313

    Google Scholar 

  5. Al-Jumah N, Hassanein H, El-Sharkawi V (2000) Implementation and modeling of two-phase locking concurrency control—a performance study. Inf Softw Technol 42(4):257–273

    Article  Google Scholar 

  6. Mohamed M, Badawy M, El-Sayed A (2016) Survey on concurrency control techniques. Commun Appl Electron 5(1):28–31

    Article  Google Scholar 

  7. Barghouti N, Kaiser GE (1991) Concurrency control in advanced database applications. ACM Comput Surv 23(3):269–317

    Article  Google Scholar 

  8. Sippu S, Soininen E (2014) Transaction processing, data-centric systems and applications. Springer International Publishing Switzerland, Basel

    MATH  Google Scholar 

  9. Mamun Q, Nakazato H (2007) Timestamp based optimistic concurrency control. IEEE Region 10 Annual International Conference, Proceedings/TENCON

  10. Rambol R, Imam Z, Ahmad N (2013) An efficient approach concurrency control in database management system: a performance analysis. IJCSNS Int J Comput Sci Netw Secur 13(7):29–33

    Google Scholar 

  11. Kung H, Robinson T (1981) On optimistic methods for concurrency control. ACM Trans Database Syst 6(2):213–226

    Article  Google Scholar 

  12. Sanchez D et al (2016) TicToc: time traveling optimistic concurrency control. Proceeding SIGMOD ‘16 Proceedings of the 2016 International Conference on Management of Data:1629-1642

  13. Rahman MD et al (2013) An efficient concurrency control technique for mobile database environment. Glob J Comput Sci Technol 13(2):17–21

    Google Scholar 

  14. Silberschartz A et al (2010) Database system concepts. McGraw-Hill Education, New York

    Google Scholar 

  15. Sadoghi M et al (2014) Reducing database locking contention sthrough multi-version concurrency. Proc VLDB Endow 7(13):1331–1342

    Article  Google Scholar 

  16. Larson P et al (1986) The performance of multi-version concurrency control algorithms. ACM Trans Comput Syst 4(4):338–378

    Article  Google Scholar 

  17. Lomet D, Mokbe M (2009) Locking key ranges with unbundled transaction services. Proc VLDB Endow 2(1):265–276

    Article  Google Scholar 

  18. Bhargava B et al (1999) Concurrency control in database systems. IEEE Trans Knowl Data Eng 11(1):3–16

    Article  Google Scholar 

  19. Mohan C et al (2002) An efficient method for performing record deletions and updates using index scans. Proceeding VLDB ‘02 Proceedings of the 28th international conference on Very Large Data Bases: 940–949

  20. Josnes E et al (2010) Low overhead concurrency control for partitioned main memory databases. Proceeding SIGMOD ‘10 Proceedings of the 2010 ACM SIGMOD International Conference on Management of data 603–613

  21. Thomson A et al (2012) Lightweight locking for main memory database systems. Proc VLDB Endow 6(2):145–156

    Article  Google Scholar 

  22. Faleiro J, Abadi D (2015) Rethinking serializable multi-version concurrency control. J Proc VLDB Endow 8(11):1190–1201

    Article  Google Scholar 

  23. Lomet D et al (2015) Multi-version range concurrency control in deuteronomy. Proc VLDB Endow—Proceedings of the 41st International Conference on Very Large Data Bases, Kohala Coast, Hawaiis 8(13): 2146–2157

  24. Dashti M et al (2017) Transaction repair for multi-version concurrency control. SIGMOD ‘17 Proceedings of the 2017 ACM International Conference on Management of Data: 235-250

  25. Wang T et al (2017) Transaction repair for multi-version concurrency control. VLDB J 26(4):537–562

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marwa Mohamed.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mohamed, M., Badawy, M. & EL-Sayed, A. An improved algorithm for database concurrency control. Int. j. inf. tecnol. 11, 21–30 (2019). https://doi.org/10.1007/s41870-018-0240-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41870-018-0240-y

Keywords

Navigation