Open AccessDesign of energy-loaded systems using the Neo4j graph database
Author(s) -
T V Zhidchenko,
M N Seredina,
Nadezhda Udintsova,
Nina Kopteva
Publication year - 2021
Publication title -
iop conference series. earth and environmental science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.179
H-Index - 26
eISSN - 1755-1307
pISSN - 1755-1315
DOI - 10.1088/1755-1315/659/1/012108
Subject(s) - computer science , graph database , graph , database , wait for graph , database design , relational database , theoretical computer science , relational database management system , distributed computing , data mining
The article presents a study of the tasks that determine the features of power-loaded networks, and tasks that are solved using graph models for power-loaded networks. The tasks that determine the features of power-loaded networks are communication check, isolation of network components and components, combinatorial tasks on graphs, calculation of flow distribution, graph simplification, optimal impact on the power grid, and determination of power proportions. This article presents the high-level architecture of Neo4j. Neo4j is an open-source graph database management system implemented in Java and is considered the most comprehensive and promising graph database management system. In comparison with modelling a graph database using a relational database management system, this approach allows applying additional optimization in the case of data with a more complex and loaded structure. The article proposes a model of an energy-loaded network, because it is a system of interaction of a large number of loads or consumers, active sources, communication lines. The declarative query language for graph databases Cypher was used for implementation. A graph database of an electrical network with a description of analytical data processing using a mathematical algorithm and software specifics of the work of queries in a multi-relational database environment has been built. When a query is executed for a user-specified network segment, a connectivity component is allocated; then for the selected elements of the network graph, correspondence is made with the elements of the network itself.