Adaptive Machine Learning-Driven Enhancements for TREEPROMPT and TREEHP2PL in Distributed Real-Time Database Systems
Abstract
Managing nested transactions in distributed real-time database systems (DRTDBS) is essential for ensuring consistency, scalability, and efficiency in critical domains such as financial systems and industrial automation. While traditional protocols like TREEPROMPT resolves inter-transaction deadlocks with speculative execution and priority inheritance and TREEHP2PL detects intra-transaction deadlocks using Wait-For Graphs and resolves them by aborting low-priority or short-execution subtransactions, their static configurations limit adaptability to dynamic workloads. This study enhances these protocols by integrating machine learning (ML) classification models to improve performance through predictive success analysis. Four ML models—Naive Bayes, Decision Tree, K-Nearest Neighbours (KNN), and Random Forest—are evaluated using a dataset of 500 transactions per simulation run, with ten independent executions to ensure statistical reliability. The experimental setup evaluates classifier performance using accuracy, precision, recall, F1-score, and computational efficiency. The results show that the Naive Bayes model achieved an accuracy of 98.5%, a precision of 98.2%, a recall of 98.7%, and an F1-score of 98.4%. The Decision Tree model performed similarly, with an accuracy of 97.8%, a precision of 97.5%, a recall of 97.9%, and an F1-score of 97.6%. In contrast, the K-Nearest Neighbours (KNN) model exhibited lower performance, with an accuracy of 44.2%, a precision of 43.8%, a recall of 44.5%, and an F1-score of 44.1%. Similarly, the Random Forest model achieved an accuracy of 45.6%, a precision of 45.3%, a recall of 45.9%, and an F1-score of 45.5%. Compared to traditional heuristic-based approaches, ML-enhanced protocols significantly improve transaction success rates by minimizing deadlock occurrences and optimizing resource utilization. Moreover, ML integration enhances system throughput and reduces transaction latency, demonstrating notable computational efficiency gains. These findings validate the effectiveness of ML-driven optimizations in enhancing protocol scalability and adaptability. Future research will focus on refining underperforming models, incorporating reinforcement learning techniques, and testing on larger datasets to further optimize real-time transaction management in DRTDBS environments.References
M. M. a. A. K. S. U. Shanker, “Distributed real-time database systems: Background and literature review,” International Journal of Distributed and Parallel Databases, vol. 23, no. 2, p. 127–149, 2008.
J. E. B. Moss, “Nested Transactions: An Approach to Reliable Distributed Computing,” Ph.D. Thesis, Technical Report MIT/LCS/TR-260,MIT Laboratory for Computer Science, Cambridge, MA, April 1981.
T. H. A. G. a. J. L. R. F. Resende, “Detection arcs for deadlock management in nested transactions and their performance,” in Advances in Databases, BNCOD ,Lecture Notes in Computer Science,Springer, Berlin,Heidelberg, 1997.
J. H. a. K. Ramamritham, “The prompt real-time commit protocol,” IEEE Transactions on Parallel and Distributed Systems, 2000.
B. S. L. A. a. A. M. A. M. Abdouli, “A System Supporting Nested Transactions in DRTDBSs,” in 1st International High-Performance Computing, September 2005.
B. S. A. Majed Abdouli, “Scheduling distributed real-time nested transactions,” in IEEE ISORC, IEEE Computer Society, 2005.
J. N. G. R. A. L. a. I. L. T. K. P. Eswaran, “The notions of consistency and predicate locks in a database system,” Communications of the ACM, vol. 19, no. 11, p. 624–633, 1976.
N. Lynch, “Concurrency control for resilient nested transactions,” Advances in Computing Research, vol. 3, p. 335–376, 1986.
N. L. a. M. Merrit, “Introduction to the theory of nested transactions,” Cambridge, Mass, 1986.
N. L. M. M. a. W. E. W. A. Fekete, “Nested transactions and read/write locking,” in 6th ACM Symposium on Principles of Database Systems, San Diego, CA, 1987.
J. K. L. a. A. Fekete, “Multi-granularity locking for nested transaction systems,” in MFDBS'91, 1991.
N. L. M. M. a. W. E. W. A. Fekete, “Commutativity-based locking for nested transactions,” Journal of System Sciences, vol. 41, p. 65–156, 1990.
S. N. M. a. B. C. S. K. Madria, “Formalization and correctness of a concurrency control algorithm for an open and safe nested transaction model using I/O automaton model,” in 8th International Conference on Management of Data (COMAD'97), Madras, India, 1997.
F. R. a. T. Harder, “Concurrency control in nested transactions with enhanced lock modes for KBMSs,” in 6th International Conference on Database and Expert Systems Applications (DEXA'95), London, UK,, 1995.
K. G. a. N. Lynch, “Nested transactions and quorum consensus,” ACM Transactions on Database Systems, vol. 19, p. 537–585, 1994.
A. F. a. T. Kameda, “Concurrency control of nested transactions accessing B-trees,” in 8th ACM Symposium on Principles of Database Systems, 1989.
S. N. M. a. B. C. S. K. Madria, “Formalization of linear hash structures using nested transactions and I/O automaton model,” in IADT 98, Berlin, Germany, 1997.
D. P. Reed, “Naming and synchronization in a decentralized computer system,” Cambridge, Mass., Sept., 1978.
R. K. Härder T, “ Concurrency Control Issues in Nested Transactions,” VLDB J, vol. 2, no. 1, pp. 39-74, 1993.
M. C. a. M. L. R. Agrawal, “Concurrency Control Performance Modeling: Alternatives and Implications,” ACM Transactions on Database Systems, Dec. 1987.
K. R. a. S. C. J. A. Stankovic, “Evaluation of a Flexible Task Scheduling Algorithm for Distributed Hard Real-Time Systems,” IEEE Transactions on Computers, vol. 34, no. 12, pp. 1130-1143, Dec. 1985.
H. T. C. a. W. Kim, “A unifying framework for versions in a CAD environment,” in Int. Conf. Very Large Data Bases, Kyoto, Japan, 1986.
J. A. S. a. D. T. J. Huang, “On using priority inheritance in real-time databases,” in Twelfth. IEEE Real-Time Systems Symposium, 1991.
R. Guerraoui, “Nested transaction: Reviewing the coherence contract,” Elsevier Sciences Journal, vol. 84, p. 161–172, 1995.
K. R. Theo Haerder, “Concepts for transaction recovery in nested transactions,” in ACM SIGMOD, 1987.
H. S. H. a. M. E. E.-S. A. A. EI-Sayed, “Effect of shaping characteristics on the performance of nested transactions,” Information and Software Technology, vol. 43, no. 10, pp. 579-590, 2001.
W. u. Haque, “Transaction Processing in Real-Time Database Systems,” 1993.
R. A. a. H. Garcia-Molina, “Scheduling Real-Time Transactions: A Performance Evaluation,” in 34th International Conference on Very Large Data Bases, 1988.
DOI:
https://doi.org/10.31449/inf.v49i31.8358Downloads
Published
How to Cite
Issue
Section
License
I assign to Informatica, An International Journal of Computing and Informatics ("Journal") the copyright in the manuscript identified above and any additional material (figures, tables, illustrations, software or other information intended for publication) submitted as part of or as a supplement to the manuscript ("Paper") in all forms and media throughout the world, in all languages, for the full term of copyright, effective when and if the article is accepted for publication. This transfer includes the right to reproduce and/or to distribute the Paper to other journals or digital libraries in electronic and online forms and systems.
I understand that I retain the rights to use the pre-prints, off-prints, accepted manuscript and published journal Paper for personal use, scholarly purposes and internal institutional use.
In certain cases, I can ask for retaining the publishing rights of the Paper. The Journal can permit or deny the request for publishing rights, to which I fully agree.
I declare that the submitted Paper is original, has been written by the stated authors and has not been published elsewhere nor is currently being considered for publication by any other journal and will not be submitted for such review while under review by this Journal. The Paper contains no material that violates proprietary rights of any other person or entity. I have obtained written permission from copyright owners for any excerpts from copyrighted works that are included and have credited the sources in my article. I have informed the co-author(s) of the terms of this publishing agreement.
Copyright © Slovenian Society Informatika







