Eng During last 365 days Approved articles: 1938,   Articles in work: 307 Declined articles: 749 
Library
Articles and journals | Tariffs | Payments | Your profile

Back to contents

The method of forming the load on the arcs of the search graph of the shortest Hamiltonian path in relation to solving the problem of scheduling the implementation of multiple transactions and queries in a network database
Filgus Dmitry Igorevich

Postgraduate Student, Department of Tool and Applied Software, MIREA - Russian Technological University

119454, Russia, g. Moscow, ul. Prospekt Vernadskogo, 78

dmif42@ya.ru

Abstract.

The subject of the research is network databases of distributed computing systems. The object of the research is the model and scheduling algorithms for the distribution of workload in network databases. The author considers in detail such aspects of the topic as a model for solving the problem of optimizing the process of managing queries in distributed information systems. It is shown that in order to eliminate the queue of requests, it is necessary to choose the most appropriate way to select queries and the best method for implementing the selected method. Promising options for serving queries are group sampling, as well as group sampling with individual segmentation. Special attention is paid to the application and development of a method for solving problems of Boolean linear and nonlinear programming based on the rank approach, which have a small time complexity and provide the required accuracy for solving these problems, as well as developing a common approach to solving arbitrary problems of boolean programming. The research methodology is the methods and models for planning, optimizing and improving the performance of network databases of distributed computing systems. The scientific novelty lies in the fact that an increase in the number of constraints in problems of nonlinear Boolean programming leads to a decrease in the error of their solution, and the degree of nonlinearity itself does not significantly affect the magnitude of the error. From an experimental study of the developed algorithms for solving the problems considered in the work, it follows that in the case of the formalization of Boolean programming problems in graph formulation, in most cases it is possible to reduce the time complexity of the algorithms for solving them. The proposed model can be used to solve the problem of optimizing the process of managing queries in distributed computing systems.

Keywords: deviation, transaction, branch and bound, ranked approach, optimization, request, dissipative structures, network database, hamiltonian path, algorithm analysis

DOI:

10.25136/2306-4196.2018.4.26624

Article was received:

17-06-2018


Review date:

20-06-2018


Publish date:

15-09-2018


This article written in Russian. You can find full text of article in Russian here .

References
1.
Bui D. B., Skobelev V. G. Modeli, metody i algoritmy optimizatsii zaprosov v bazakh dannykh // Komp'yuternye sistemy i informatsionnye tekhnologii 2014, 2 (66) 46 C. 43-58
2.
Listrovoy, S.V., Tretjak, V.F. and Listrovaya, A.S. (1999), Parallel algorithms of calculation process optimization for the Boolean programming problems,Ibid., Vol. 16, pp. 569-579.
3.
Tret'yak V.F., Pashneva A. A. Optimizatsiya struktury khranilishcha dannykh v uzlakh seti infokommunikatsionnoi seti oblachnogo khranilishcha // Sistemy navigatsii i svyazi Poltavskogo natsional'nogo universiteta imeni Yuriya Kondratyuka. 4 (44).-2017-S. 122-128
4.
Dubinin V.N., Zinkin S.A. Setevye modeli raspredelennykh sistem obrabotki, khraneniya i peredachi dannykh Monografiya. Penza: Privolzhskii Dom znanii, 2013. 452 s.
5.
Fedorin A.N. Mnogokriterial'nye zadachi rantsevogo tipa: razrabotka i sravnitel'nyi analiz algoritmov: Dis. ... kand. tekhn. nauk: 05.13.18 / Nizhegorodskii gosudarstvennyi universitet im. N.I. Lobachevskogo. Nizhnii Novgorod, 2010.-132 s.
6.
Informatsionnoe obespechenie sistem organizatsionnogo upravleniya (teoreticheskie osnovy) [Tekst] : v 3-kh ch. / pod red. E. A. Mikrina, V. V. Kul'by.-M. : Fizmatlit, 2011-. Ch. 2 : Metody analiza i proektirovaniya informatsionnykh sistem / E. A. Mikrin [i dr.].-2011.-493 s.
7.
Andrianova E.G., Mel'nikov S.V., Raev V.K. Dissipatsiya i entropiya v fizicheskikh i informatsionnykh sistemakh // Fundamental'nye issledovaniya. 2015. 82. C. 233238.
8.
Kveglis L. I.Dissipativnye struktury v tonkikh nanokristallicheskikh plenkakh : monografiya / L. I. Kveglis, V. B. Kashkin ; otv. red. V. F. Shabanov.-Krasnoyarsk: Sib. feder. un-t, 2011.-204 s.
9.
Patent na poleznuyu model' 69487, Ukraina, MPK G06 F15/00. Ustroistvo dlya resheniya zadach na grafakh / V.F. Tret'yak, D.Yu. Golubnichii i dr. u201113667; zayav. 21.11.2011; opubl. 25.04.2012; Byul. 8. 6 s