|
Home
|
Back to issue
|
ISSN 0474-8662. Information Extraction and Processing. 2017. Issue 45 (121)
The optimization of databases replication in distributed information systems
Tsegelyk G. G.
Ivan Franko National University of Lviv
Krasniuk R. P.
Ivan Franko National University of Lviv
https://doi.org/10.15407/vidbir2017.45.104
Keywords: optimization, databases replication, distributed information systems, dynamic
programming, Bellman equation, Greedy algorithm.
Cite as: Tsegelyk G. G., Krasniuk R. P. The optimization of databases replication in distributed information systems. Information Extraction and Processing. 2017, 45(121), 104-112. DOI:https://doi.org/10.15407/vidbir2017.45.104
Abstract
New mathematical models of optimal distribution of databases replication in nodes of distributed information systems are formulated by the criteria: minimization of maintenance costs; restricted memory resources; minimizing synchronization time; minimizing the average time needed to search information. Precise solutions of the problems with the use of dynamic programming methods are constructed, Bellman recursive equations are obtained. The general scheme of the computational algorithm using the “greedy” choice procedure is presented and an algorithm for improving the obtained result is proposed. The strategies of greedy choice were investigated, the choice of criteria in the strategy of greedy choice is substantiated. The proposals have been formed regarding the formation of a balance between the accuracy and computational complexity of the algorithm through the introduction of a restricted search strategy. The computational complexity of the algorithm is estimated and its correctness is substantiated.
References
1. Sadalage, P. J.; Fowler, M. NoSQL Distilled: A Brief Guide to the Emerging World of Polyglot Persistence. Addison-Wesley: NY, 2012; p 680.
2. Tsegelyk, H.H. Distributed Database Systems. Svit: Lviv, 1990; p168. (in russian)
3. Beskorovayny, V.V.; Ulyanova, O.S. Mathematical Models of Multicriteria Synthesis of Physical Structures of Distributed Databases. Eastern European Journal of Advanced Technologies. 2010; 4, 44-48. (in russian)
4. Yakovlev, S. On the concept of construction and selection of distributed databases of information retrieval systems. Mathematical Machines and Systems. 2013; 2, 35-53. (in russian)
5. Chumachenko, E.I.; Zakharov, S.S. Algorithmic provision of distributed databases. Artificial Intelligence. 2013; 1, 49-54. (in russian)
6. Tsegelyk, H.H. Mathematical programming. LNU: Lviv; 2011; p 168.
7. Coffman, E. G.; Garey, M. R.; Johnson, D. S. Approximation algorithms for bin packing: A survey. Approximation algorithms for NP-hard problems. PWS Publishing Co.: Boston, 1996.; pp 46-93.