International Journal of Information Technology and Computer Science (IJITCS)
IJITCS Vol. 17, No. 4, 8 Aug. 2025
Cover page and Table of Contents: PDF (size: 586KB)
Methods of Increasing the Efficiency of Data Consistency in Information Systems
PDF (586KB), PP.28-37
Views: 0 Downloads: 0
Author(s)
Index Terms
Database, Distributed Systems, NoSql, Data Consistency, Consistency, Transactions, Transactional Clock, Active Anti-entropy, Bloom Filter
Abstract
The article is devoted to special methods for distributed databases that allow to accelerate data reconciliation in information systems, such as IoT, heterogeneous multi-computer systems, analytical administrative management systems, financial systems, scientific management systems, etc. A method for ensuring data consistency using a transaction clock is proposed and the results of experimental research for the developed prototype of a financial system are demonstrated. The transaction clock receives transactions from client applications and stores them in appropriate queues. The queues are processed based on the transaction priority. The highest priority queue is processed before the lowest priority queue. This allows you to determine which important data (such as financial transactions) should be processed first. The article justifies the replacement of the Merkle tree with a hashing algorithm and the use of the Bloom spectral filter to improve the Active Anti-Entropy method to accelerate eventual consistency. For its effective use, the filter generation algorithm is modified, which allowed to increase the speed of its generation and maintain a sufficient level of collision resistance.
Cite This Paper
Nikitin Valerii, Krylov Ievgen, Anikin Volodymyr, "Methods of Increasing the Efficiency of Data Consistency in Information Systems", International Journal of Information Technology and Computer Science(IJITCS), Vol.17, No.4, pp.28-37, 2025. DOI:10.5815/ijitcs.2025.04.03
Reference
[1]V. Nikitin, E. Krylov, Y. Kornaga, and V. Anikin, “Combined indexing method in NoSQL databases,” Adaptive Systems of Automatic Control, vol. 1, no. 38, pp. 3–9, 2021. [Online]. Available: https://doi.org/10.20535/1560-8956.38.2021.232948.
[2]V. Mukhin, V. Zavgorodnii, V. Nikitin, Y. Kornaga, I. Fartushnyi, and A. Stepanov, “Method of determining the required number of database nodes in a distributed data processing system,” in Proc. 2021 IEEE 3rd Int. Conf. Advanced Trends in Information Theory (ATIT), 2021. [Online]. Available: https://doi.org/10.1109/ATIT54053.2021.9678569.
[3]S. Gupta, K. Saroha, and Bhawna, “Fundamental research of distributed database,” IJCSMS International Journal of Computer Science and Management Studies, vol. 11, no. 2, pp. 138, Aug. 2011. [Online]. Available: https://www.researchgate.net/publication/266892710_Fundamental_Research_of_Distributed_Database.
[4]A. Wibowo and M. Subekti, “Building scalable and resilient database system to mitigate disaster and performance risks,” Procedia Computer Science, vol. 135, pp. 25–34, 2018.
[5]R. Alt, R. Beck, and M. T. Smits, “Fintech and the transformation of the financial industry,” Electronic Markets, vol. 28, no. 3, pp. 235–243, 2018. [Online]. Available: https://doi.org/10.1007/s12525-018-0310-9.
[6]C.-O. Truică, A. Boicea, and I. Trifan, “CRUD operations in MongoDB,” in Proc. 2013 Int. Conf. Advanced Computer Science and Electronics Information (ICACSEI), Beijing, China, Jul. 2013, pp. 347. [Online]. Available: https://doi.org/10.2991/icacsei.2013.88.
[7]C. Leng, J. Wu, J. Cheng, X. S. Zhang, and H. Lu, “Hashing for distributed data,” in Proc. Int. Conf. Machine Learning (ICML), Lille, France, Apr. 2015.
[8]R. van Renesse, D. Dumitriu, V. Gough, and C. Thomas, “Efficient reconciliation and flow control for anti-entropy protocols,” in Proc. 2nd Workshop on Large-Scale Distributed Systems and Middleware (LADIS '08), Sep. 2008, Art. no. 6, pp. 1–7. [Online]. Available: https://doi.org/10.1145/1529974.1529983.
[9]V. Nikitin and E. Krylov, “Usage of transaction clock to speed up the data consistency process in distributed systems,” Scientific Bulletin of Uzhhorod University. Series of Mathematics and Informatics, vol. 42, no. 1, pp. 188–192, 2023. [Online]. Available: https://doi.org/10.24144/2616-7700.2023.42(1).188-192.
[10]V. Nikitin and E. Krylov, “Methods of increasing the efficiency of data consistency in information systems,” National Technical University of Ukraine ‘Igor Sikorsky Kyiv Polytechnic Institute, [Online]. Available: https://discovery.kpi.ua/Record/dspace.elakpi-123456789-67224.
[11]V. Nikitin and E. Krylov, “Comparison of hashing methods for supporting consistency in distributed databases,” Adaptive Systems of Automatic Control, vol. 1, no. 40, pp. 48–53, 2022. [Online]. Available: https://doi.org/10.20535/1560-8956.40.2022.261646.
[12]V. Nikitin, E. Krylov, Y. Kornaga, and V. Anikin, “Modification of hashing algorithm to increase rate of operations in NoSQL databases,” Adaptive Systems of Automatic Control, vol. 2, no. 39, pp. 39–43, 2021. [Online]. Available: https://doi.org/10.20535/1560-8956.39.2021.247395.
[13]V. Nikitin and E. Krylov, “Active anti-entropy mechanism based on Spectral Bloom filter and PH-2 hash algorithm for reconciliation of replicas of NoSQL distributed document-oriented databases,” Information Technology and Society, vol. 3, no. 9, pp. 63–67, 2023. [Online]. Available: https://doi.org/10.32689/maup.it.2023.3.8.
[14]V. Nikitin and E. Krylov, “Primary-based Spectral Bloom filter for ensuring consistency in distributed document-based NoSQL databases using Active Anti-Entropy mechanism,” Computer Systems and Information Technologies, no. 3, pp. 75–80, 2023. [Online]. Available: https://doi.org/10.31891/csit-2023-3-9.
[15]V. Nikitin and E. Krylov, “A collision-resistant hashing algorithm for maintaining consistency in distributed NoSQL databases,” Adaptive Systems of Automatic Control, vol. 2, no. 41, pp. 45–57, 2022. [Online]. Available: https://doi.org/10.20535/1560-8956.41.2022.271338.