Open AccessALGORITHM FOR SOLVING PROBLEM SYNTHESIS THE OPTIMAL LOGICAL STRUCTURE DISTRIBUTED DATA IN ARCHITECTURE OF GRID SERVICE
Author(s) -
Eleurmatova,
V.V. Gusev
Publication year - 2021
Publication title -
9th international conference "distributed computing and grid technologies in science and education"
Language(s) - English
Resource type - Conference proceedings
DOI - 10.54546/mlit.2021.31.72.001
Subject(s) - computer science , logical data model , grid , logical conjunction , distributed computing , data structure , database , distributed database , node (physics) , service (business) , theoretical computer science , data modeling , programming language , mathematics , geometry , structural engineering , engineering , economy , economics
The questions of constructing optimal logical structure of a distributed database (DDB) are considered.Solving these issues will make it possible to increase the speed of processing requests in DDB incomparison with a traditional database. In particular, such tasks arise for the organization of systemsfor processing huge amounts of information from the Large Hadron Collider. In these systems variousDDB are used to store information about: the system of triggers of data collection from physicalexperimental installations, the geometry and the operating conditions of the detector while collectingexperimental data. Two interrelated stages in the synthesis algorithm are proposed. At the first stage,the problem of distribution of database clusters between the server and clients, followed by theproblem of optimal distribution of data groups of each node by types of logical records are addressed.At the second stage the problem of database localization on the nodes of the computer network issolved, in addition to the results of the first stage, the characteristics of the DDB are taken intoaccount. Optimal logical structure of DDB will ensure the efficiency of the information system oncomputational resources. As a result of its solution, the local network of the DDB is decomposed intoa number of clusters that have minimal information connectivity with each other. Solving the problemof synthesis of the optimal logical structure is also of great practical importance for the automateddesign of logical structures, for the automated formation of query specifications and adjustments of theDDB.