International Journal of

ADVANCED AND APPLIED SCIENCES

EISSN: 2313-3724, Print ISSN: 2313-626X

Frequency: 12
line decor
  
line decor

 Volume 9, Issue 7 (July 2022), Pages: 159-171

----------------------------------------------

 Original Research Paper

 A two-part multi-algorithm concurrency control optimization strategy for distributed database systems

 Author(s): Nasser Shebka 1, 2, *

 Affiliation(s):

 1Department of Computer Science, Northern Border University, Arar, Saudi Arabia
 2Computer Science College, Al Neelian University, Khartoum, Sudan

  Full Text - PDF          XML

 * Corresponding Author. 

  Corresponding author's ORCID profile: https://orcid.org/0000-0002-2582-1150

 Digital Object Identifier: 

 https://doi.org/10.21833/ijaas.2022.07.016

 Abstract:

In this paper, we propose a novel holistic approach to address the issues of concurrency control after an exhaustive examination of the problem and the various forms it can transpire. The proposed strategy was formulated depending on different perspectives that are based on exploring a wide range of algorithms, methods, and strategies proposed in practice and theory that attempted to address the problem and its forms, but only partially succeeded in doing so. Here we proposed a two-part holistic strategy to optimize concurrency control in distributed environments that address a wide range of concurrency control anomalies by taking advantage of several concurrency control algorithms' strengths while minimizing their weaknesses. The novelty of our approach transpires from two interconnected parts that can be applied regardless of the type of distributed database environment. The first is a structured tier-based data classification system based on data sensitivity with respect to serializability requirements and ranges from strict to very relaxed forms of serializability constraints. The second is a concurrency management algorithm that allocates the appropriate concurrency control algorithm to each transaction depending on the type of transaction and/or type of data being accessed from the aforementioned tier-based classification method. Our proposed method also incorporates a priority allocation mechanism within the concurrency management algorithm. Priority is allocated to different tier transactions depending on the tier's level, which in turn reflects data importance and sensitivity. Although our proposed strategy remains an algorithmic approach as we encountered various challenges regarding performance testing of a novel multi-algorithm approach for handling concurrency control in distributed database systems. However, future work involves testing the performance of our proposed strategy either through real-time systems after considerable adjustments or by constructing an appropriate customized simulation framework. Finally, the potentials of the strategy presented here are very promising, hence, we recommend as we are also optimistic that other scholars are encouraged to further exploit the concept of using multiple concurrency control algorithms within the same distributed database environment.

 © 2022 The Authors. Published by IASE.

 This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

 Keywords: Concurrency control, Distributed database systems, Serializability, Tier-based structure

 Article History: Received 19 January 2022, Received in revised form 23 April 2022, Accepted 24 April 2022

 Acknowledgment 

The author gratefully acknowledges the approval and the support of this research study by grant no. COM-2018-3-9-F-7921 from the Deanship of Scientific Research at Northern Border University, Arar, K.S.A.

 Compliance with ethical standards

 Conflict of interest: The author(s) declared no potential conflicts of interest with respect to the research, authorship, and/or publication of this article.

 Citation:

 Shebka N (2022). A two-part multi-algorithm concurrency control optimization strategy for distributed database systems. International Journal of Advanced and Applied Sciences, 9(7): 159-171

 Permanent Link to this page

 Figures

 Fig. 1 Fig. 2 Fig. 3 Fig. 4 

 Tables

 No Table  

----------------------------------------------    

 References (35)

  1. Akintola AA, Aderounmu GA, Osakwe AU, and Adigun MO (2005). Performance modeling of an enhanced optimistic locking architecture for concurrency control in a distributed database system. Journal of Research and Practice in Information Technology, 37(4): 365-380.   [Google Scholar]
  2. Alkhatib G and Labban RS (2002). Transaction management in distributed database systems: The case of oracle’s two-phase commit. Journal of Information Systems Education, 13(2): 95-104‏.   [Google Scholar]
  3. Bakura SA and Mohammed A (2014). Lock-free hybrid concurrency control strategy for mobile environment. In the IEEE 6th International Conference on Adaptive Science and Technology, IEEE, Ota, Nigeria: 1-5. https://doi.org/10.1109/ICASTECH.2014.7068146   [Google Scholar]
  4. Batra N and Kapil AK (2010). Concurrency control algorithms and its variants: A survey. AIP Conference Proceedings: American Institute of Physics, 1324: 46-50. https://doi.org/10.1063/1.3526261   [Google Scholar]
  5. Bernstein PA and Goodman N (1981). Concurrency control in distributed database systems. ACM Computing Surveys, 13(2): 185-221. https://doi.org/10.1145/356842.356846   [Google Scholar]
  6. Bernstein PA and Newcomer E (2009). Principles of transaction processing. Morgan Kaufmann Publishers, Burlington, USA. https://doi.org/10.1016/B978-1-55860-623-4.00004-4   [Google Scholar]
  7. Bernstein PA, Hadzilacos V, and Goodman N (1987). Concurrency control and recovery in database systems. Volume 370, Addison-Wesley, Boston, USA.   [Google Scholar]
  8. Carey MJ and Livny M (1988). Distributed concurrency control performance: A study of algorithms, distribution, and replication. In: Bancilhon F and DeWitt DJ (Eds.), Proceedings of the 1988 VLDB Conference: 14th International Conference on Very Large Data Bases: 13-25. Morgan Kaufmann Publishers, Burlington, USA.   [Google Scholar]
  9. Carey MJ and Muhanna WA (1986). The performance of multiversion concurrency control algorithms. ACM Transactions on Computer Systems, 4(4): 338-378‏. https://doi.org/10.1145/6513.6517   [Google Scholar]
  10. D'Angelo G, Ferretti S, and Ghini V (2018). Distributed hybrid simulation of the internet of things and smart territories. Concurrency and Computation: Practice and Experience, 30(9): e4370. https://doi.org/10.1002/cpe.4370   [Google Scholar]
  11. Dean J and Ghemawat S (2007). Distributed programming with MapReduce. In: Oram A and Wilson G (Eds.), Beautiful code: 371-384. OReilly Media, Inc., Sebastopol, USA.   [Google Scholar]
  12. Geschwent P (1994). A survey of traditional and practical concurrency control in relational database management systems. Technical Reports, Miami University, Oxford, USA.   [Google Scholar]
  13. Gray J, Helland P, O'Neil P, and Shasha D (1996). The dangers of replication and a solution. In the 1996 ACM SIGMOD International Conference on Management of Data, Association for Computing Machinery, Montreal, Canada: 173-182. https://doi.org/10.1145/235968.233330   [Google Scholar]
  14. Gray JN (1991). Notes on database operating systems. Operating Systems: An Advanced Course, 60: 397-405.   [Google Scholar]
  15. Haapasalo T, Sippu S, Jaluta I, and Soisalon-Soininen E (2009). Concurrent updating transactions on versioned data. In the 2009 International Database Engineering and Applications Symposium, Association for Computing Machinery, Cetraro-Calabria, Italy: 77-87. https://doi.org/10.1145/1620432.1620441   [Google Scholar]
  16. Haapasalo TK, Jaluta IM, Sippu SS, and Soisalon-Soininen EO (2008). Concurrency control and recovery for multiversion database structures. In the 2nd Ph.D. Workshop on Information and Knowledge Management, Association for Computing Machinery, Napa Valley, USA: 73-80. https://doi.org/10.1145/1458550.1458563   [Google Scholar]
  17. Herlihy MP and Weihl WE (1991). Hybrid concurrency control for abstract data types. Journal of Computer and System Sciences, 43(1): 25-61. https://doi.org/10.1016/0022-0000(91)90031-Y   [Google Scholar]
  18. Kanungo S and Rustom DM (2015). Analysis and comparison of concurrency control techniques. International Journal of Advanced Research in Computer and Communication Engineering, 4(3): 245-251. https://doi.org/10.17148/IJARCCE.2015.4360   [Google Scholar]
  19. Kim J and Shin H (1994). Optimistic priority-based concurrency control protocol for firm real-time database systems. Information and Software Technology, 36(12): 707-715. https://doi.org/10.1016/0950-5849(94)90042-6   [Google Scholar]
  20. Kumar N, Bilgaiyan S, and Sagnika S (2013). An overview of transparency in homogeneous distributed database system. International Journal of Advanced Research in Computer Engineering and Technology, 2(10)‏: 2677-2682.   [Google Scholar]
  21. Kung HT and Robinson JT (1981). On optimistic methods for concurrency control. ACM Transactions on Database Systems, 6(2): 213-226. https://doi.org/10.1145/319566.319567   [Google Scholar]
  22. Lam KY, Lee VC, Hung SL, and Kao BC (1997). Priority assignment in distributed real-time databases using optimistic concurrency control. IEE Proceedings-Computers and Digital Techniques, 144(5): 324-330. https://doi.org/10.1049/ip-cdt:19971496   [Google Scholar]
  23. Li JM and He GH (2010). Research of distributed database system based on Hadoop. In The 2nd International Conference on Information Science and Engineering, IEEE, Hangzhou, China: 1417-1420. https://doi.org/10.1109/ICISE.2010.5689141   [Google Scholar]
  24. Lindström J (2004). Performance of distributed optimistic concurrency control in real-time databases. In the International Conference on Intelligent Information Technology, Springer, Hyderabad, India: 243-252. https://doi.org/10.1007/978-3-540-30561-3_26   [Google Scholar]
  25. Liu L and Özsu MT (2009). Encyclopedia of database systems. Volume 6, Springer, New York, USA. https://doi.org/10.1007/978-0-387-39940-9   [Google Scholar]
  26. Menasce DA and Muntz, RR (1979). Locking and deadlock detection in distributed data bases. IEEE Transactions on Software Engineering, SE-5(3): 195-202. https://doi.org/10.1109/TSE.1979.234181   [Google Scholar]
  27. Moiz SA (2015). A hybrid concurrency control strategy for mobile database systems. Journal of Advanced Research, 3(4): 374-381. https://doi.org/10.9734/AIR/2015/12406   [Google Scholar]
  28. Rahimi SK and Haug FS (2010). Distributed database management systems: A practical approach. John Wiley and Sons, Hoboken, USA. https://doi.org/10.1002/9780470602379   [Google Scholar]
  29. Raz Y (1992). The principle of commitment ordering or guaranteeing serializability in a heterogeneous environment of multiple autonomous resource managers using atomic commitment. In the 18th International Conference on Very Large Databases (VLDB’92), Morgan Kaufmann Publishers, Vancouver, Canada: 292–312.   [Google Scholar]
  30. Rosenkrantz DJ, Stearns RE, and Lewis PM (1978). System level concurrency control for distributed database systems. ACM Transactions on Database Systems, 3(2): 178-198. https://doi.org/10.1145/320251.320260   [Google Scholar]
  31. Sheikhan M and Ahmadluei S (2013). An intelligent hybrid optimistic/pessimistic concurrency control algorithm for centralized database systems using modified GSA-optimized ART neural model. Neural Computing and Applications, 23(6): 1815-1829. https://doi.org/10.1007/s00521-012-1147-3   [Google Scholar]
  32. Silberschatz A, Korth HF, and Sudarshan S (2002). Database system concepts. Volume 5, McGraw-Hill, New York, USA. https://doi.org/10.1016/B0-12-227240-4/00028-9   [Google Scholar]
  33. Sinha MK, Nandikar PD, and Mehndiratta SL (1985). Timestamp based certification schemes for transactions in distributed database systems. ACM SIGMOD Record, 14(4): 402-411. https://doi.org/10.1145/971699.318990   [Google Scholar]
  34. Taina J and Raatikainen K (1996). RODAIN: A real-time object-oriented database system for telecommunications. In: Soparkar N and Ramamritham K (Eds.), Proceedings of the workshop on databases: Active and real-time: 10-14. University of Massachusetts, Boston, USA. https://doi.org/10.1145/352302.352306   [Google Scholar]
  35. Thomasian A (1998). Distributed optimistic concurrency control methods for high-performance transaction processing. IEEE Transactions on Knowledge and Data Engineering, 10(1): 173-189. https://doi.org/10.1109/69.667102   [Google Scholar]