CN115269745A - Relational data-to-graph data mapping method, device and storage medium - Google Patents

Abstract

The invention relates to the technical field of data processing, in particular to a method, equipment and a storage medium for mapping relational data to graph data, wherein the method comprises the following steps: acquiring data table information in a relational database, wherein the data table information at least comprises an equipment entity table, an association relation table and a primary key; traversing the equipment entity table, and sequentially creating equipment nodes in the graph database according to the main key; searching whether subsequent equipment exists in the association relation table or not according to the equipment nodes; if the subsequent equipment exists, searching the equipment entity table of the subsequent equipment, and judging whether the equipment node is established in the graph database; if the equipment node is not created, a new node is created, and the incidence relation among the nodes is created according to the incidence relation table; and if the equipment nodes are established, establishing the association relationship among the nodes according to the association relationship table. According to the invention, automatic mapping from relational data to graph data can be completed, and a more efficient and intuitive database is provided for subsequent association analysis, data retrieval and the like.

Description

Method, device and storage medium for mapping relational data to graph data

technical field

The present invention relates to the technical field of data processing, in particular to a method, device and storage medium for mapping relational data to graph data.

Background technique

With the rapid development of the Internet of Things technology, the intelligence of the power grid has gradually become popular. Based on the development of a high-speed and stable two-way communication network, the smart grid integrates efficient control methods, decision-making strategies and equipment technologies, and finally forms a cash-based transmission system. Power grid applications with sensing technology and measurement technology as the core. The smart grid is the product of the joint development of Internet technology and traditional power technology. Its goal is to meet the intelligent management and efficient operation and maintenance of the power system, and to provide users with good power services. However, with the continuous development of smart grid technology, widely distributed smart terminals generate massive data, how to store and analyze massive data has become a difficult problem for the further development of smart grid.

In existing smart grid systems, relational databases are mainly used to store data collected by smart terminals and user data. However, when relational data has a large amount of data, the search response time for data will be very long. General database systems It mainly involves the four basic operations of adding, deleting, modifying, and searching. For data search and search, relational databases require a large number of connection and traversal operations, which are not only complicated but also time-consuming.

For connection operations, the graph database can use the index-free adjacency feature to realize the query function independent of the data scale. The graph database can help store a large amount of high-relationship data, conduct complex analysis on the relationship, and provide data for the discovery of data correlation and power grid innovation. huge potential. The storage structure design of existing smart grid systems and other power grid management systems is based on relational databases. Although the development of relational databases is relatively mature, relational databases are not suitable for the storage of highly correlated data. Therefore, there is an urgent need for A method for automatically converting distribution network data in a relational database into data in a graph database.

The information disclosed in this Background section is only intended to enhance the understanding of the general background of the present invention, and should not be considered as an acknowledgment or any form of suggestion that the information constitutes the prior art that is already known to those skilled in the art.

Contents of the invention

The present invention provides a method, device and storage medium for mapping relational data to graph data, thereby effectively solving the problems in the background technology.

In order to achieve the above object, the technical solution adopted in the present invention is: a method for mapping relational data to graph data, comprising the following steps:

Obtain data table information in a relational database, where the data table information at least includes a device entity table, an association table and a primary key;

Traversing the device entity table, creating device nodes in the graph database sequentially from the device entity table according to the primary key;

Retrieving whether there is a successor device in the association table according to the device node;

If there is a subsequent device, retrieve the device entity table of the subsequent device, and determine whether the device node has been created in the graph database;

If no device node is created, a new node is created, and an association relationship between nodes is created according to the association relationship table;

If the device nodes have been created, an association relationship between nodes is created according to the association relationship table.

Further, when acquiring data table information in a relational database, it is judged whether at least the device entity table, association table and primary key are included;

If not, stop mapping.

Further, when acquiring data table information in a relational database, it is judged whether the device entity table has a single primary key;

If not, stop mapping.

Further, the step of sequentially creating device nodes in the image database from the device entity table according to the primary key includes:

Obtain several key values corresponding to the primary key of the device entity table;

Searching for device information in the device entity table and the association relationship table according to the key value;

The found device information is written into the image database as an attribute of the device node node _i .

Further, the searching for device information in the device entity table and the association relationship table according to the key value includes the following steps:

S100: Create a key-value pair {k _i : v _i } according to the primary key id of the device entity table, where k _i is the id of the i-th key value of the primary key, and v _i is the tag value of the i-th key value, and The initial value of v _i is 0;

S110: Create a collection map, and add the key-value pair {k _i : v _i } to the collection map;

S120: traversing the key-value pairs whose tag values are 0 in the set map in sequence, and searching for the device information;

S130: Set the value of the tag value v _i of the traversed key-value pair to 1;

S140: judging whether the tag values v _i in the set map are all 1;

If not, repeat steps S120 to S130, and if yes, complete the search.

Further, according to the device node, when retrieving whether there is a successor device in the association relationship table, the following steps are included:

S200: According to the created device node node _i , the key-value pair corresponding to the device node node _i is {k _i : 1};

S210: Add the device node node _i to the precursor queue;

S220: Determine whether the precursor queue is empty;

S230: If not, take out the head node node _p of the precursor queue, and the primary key value corresponding to the head node node _p is _kp ; if so, return to the step S140;

S240: Retrieve whether there is a follow-up device of the head node node _p in the association table, the key value of the follow-up device is k _j , and v _j is 0;

S250: If yes, then find the device whose key value is k _j in the device entity table, and create a new node node _j ; if not, return to the step S220;

S260: Create an association relationship for nodes node _p and node _j according to the association relationship table;

S270: Put the node node _j into the precursor queue, and return to the step S240.

Further, the following steps are also included:

Monitor whether there is equipment change in the PMS system;

If so, modify the device node and/or the association relationship according to the device entity table and/or the association relationship table.

Further, the device change includes any one or more of: adding new devices, decommissioning devices, changing device information, and changing related information between devices.

Further, when adding a device, a new node is created according to the device entity table, and an association relationship between the new node and an original node is created according to the association relationship table.

Further, when the device is decommissioned, the device node corresponding to the device is deleted, and the association relationship between other device nodes and the device node is deleted.

Further, when the device information changes, the device node attribute information is modified according to the device entity table.

Further, when the association information between the devices changes, the association information between the device nodes is modified according to the association relationship table.

Further, the data table information also includes a device record table describing device information, and when creating the device node, the device information in the device record table is written into the image database as an attribute of the device node.

The present invention also includes a computer device, including a memory, a processor, and a computer program stored in the memory and operable on the processor. When the processor executes the computer program, the above method is realized.

The present invention also includes a storage medium on which a computer program is stored, and when the computer program is executed by a processor, the above method is realized.

The beneficial effects of the present invention are as follows: the present invention obtains the data table information in the relational database, then creates a device node according to the device entity table, the association relationship table and the primary key, and searches whether there is a successor device based on the created device node. For the successor device, it is judged whether the device node has been created for the successor device. If the device node has been created, the association relationship between the nodes is created. If the device node is not created, a new node is created, and the association relationship between the nodes is created. All equipment information in the database will generate equipment nodes in the graph database, and an association relationship will be created between nodes, so that the topology of the distribution network in the relational database can be automatically integrated under the premise of not changing the existing smart grid system as much as possible. It can be transformed into graphic data in a graphic database, and can complete automatic mapping, providing a more efficient and intuitive database for subsequent correlation analysis, data retrieval, etc.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings that need to be used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are only These are some embodiments described in the present invention. Those skilled in the art can also obtain other drawings based on these drawings without creative work.

Fig. 1 is the flowchart in embodiment 1;

Fig. 2 is the flowchart in embodiment 2;

Fig. 3 is a schematic structural diagram of a computer device.

Detailed ways

The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention.

Example 1:

As shown in Figure 1: a method for mapping relational data to graph data, including:

Obtain the data table information in the relational database, the data table information includes at least the equipment entity table, the association table and the primary key;

Traversing the equipment entity table, according to the primary key, the equipment entity table is sequentially created in the graph database to create equipment nodes;

According to the device node, retrieve whether there is a successor device in the association table;

If there is a subsequent device, retrieve the device entity table of the subsequent device to determine whether the device node has been created in the graph database;

If no device node is created, create a new node, and create an association relationship between nodes according to the association relationship table;

If the device node has been created, create an association relationship between nodes according to the association relationship table.

Obtain the data table information in the relational database, and then create a device node based on the device entity table, association relationship table and primary key, and retrieve whether there is a successor device based on the created device node. If there is a successor device, judge whether the successor device is The device node has been created. If the device node has been created, the association relationship between the nodes will be created. If the device node has not been created, a new node will be created, and then the inter-node association relationship will be created. Finally, all the equipment information in the relational database will be displayed on the graph Device nodes are generated in the database, and association relationships are created between nodes, so that the distribution network topology in the relational database is automatically converted into graph data in the graph database without changing the existing smart grid system as much as possible. And it can complete automatic mapping, providing a more efficient and intuitive database for subsequent correlation analysis and data retrieval.

In this embodiment, when obtaining the data table information in the relational database, it is judged whether at least the equipment entity table, the association table and the primary key are included;

If not, stop mapping.

Among them, when obtaining the data table information in the relational database, it is judged whether the equipment entity table has a single primary key;

If not, stop mapping.

When converting a relational database to a graph database, it is necessary to create equipment nodes and connections between nodes, so at least equipment entity tables and association relationship tables are required, and the equipment entity tables have a single primary key. If the current distribution network database does not satisfy These conditions stop mapping.

In this embodiment, according to the primary key, the device entity table is sequentially created in the image database to create device nodes, including:

Obtain several key values corresponding to the primary key of the device entity table;

Find device information in the device entity table and association table according to the key value;

Write the found device information into the image database as the attribute of the device node node _i .

The primary key is a combination of one or more, whose value can uniquely identify a certain row in the table, through which the entity integrity of the table can be enforced, the primary key is mainly used to associate with foreign keys of other tables, and to modify and delete text records . According to the key value of the primary key, the device information is searched, so that the found device information is used as an attribute of a device node node _i in the graph database, and written into the graph database.

As a preferred embodiment of the foregoing, searching for device information in the device entity table and the association table according to the key value includes the following steps:

S100: According to the primary key id of the device entity table, create a key-value pair {k _i : v _i }, where k _i is the id of the i-th key value of the primary key, v _i is the tag value of the i-th key value, and v _i The initial value of is 0;

S110: Create a collection map, and add the key-value pair {k _i : v _i } to the collection map;

S120: traversing the key-value pairs with a tag value of 0 in the collection map in turn to find device information;

S130: Let the value of the tag value v _i of the traversed key-value pair be 1;

S140: Determine whether the tag values v _i in the set map are all 1;

If not, repeat steps S120 to S130, and if yes, complete the search.

Create a key-value pair through the primary key id, and use the tag value to judge whether the device corresponding to the key value has been created in the graph database, so when creating a key-value pair, set the initial value of the tag value to 0, and traverse the collection When a key-value pair with a mark value of 0 is found in the map, search for the corresponding device information of that key-value pair, and then create a device node. At the same time, set the mark value of this key-value pair to 1, and then search for the next mark value The key-value pairs of 0 until the tag values of all key-value pairs in the collection map are 1.

Among them, according to the device node, when retrieving whether there is a successor device in the association relationship table, the following steps are included:

S200: According to the created device node node _i , the key-value pair corresponding to the device node node _i is {k _i : 1};

S210: adding the device node node _i to the precursor queue;

S220: Determine whether the precursor queue is empty;

S230: If not, take out the leader node node _p of the precursor queue, and the primary key value corresponding to the leader node node _p is _kp ; if yes, return to step S140;

S240: Retrieve whether there is a follow-up device of the head node node _p in the association table, the key value of the follow-up device is k _j , and v _j is 0;

S250: If yes, find the device whose key value is k _j in the device entity table, and create a new node node _j ; if not, return to step S220;

S260: Create an association relationship for node _p and node _j according to the association relationship table;

S270: put the node node _j into the precursor queue, and return to step S240.

Through the above steps, after a device node _i has been created, the key-value pair of node _i is {k _i : 1}, and this device node node _i is added to the precursor queue. According to the nature of the queue, the queue is a A special linear table that only allows deletion operations at the front end of the table, and insertion operations at the back end of the table. The end of the insertion operation is called the tail of the queue, and the end of the deletion operation is called the head of the queue. Take it out, and search whether there is a follow-up device according to the taken-out node node _p . If there is a follow-up device with a value of 0 in the key-value pair, it means that the follow-up device has not yet created a device node in the graph database. At this time, create a new node node _j , and set v _j to 1 at the same time, and then create an association relationship between node _p and node _j . At this time, put node _j into the precursor queue, repeatedly retrieve the subsequent devices of node _j and create nodes and associations for the subsequent devices of node _j relationship, until there is no follow-up device, at this time the precursor queue is empty, and then return to the key-value pair whose tag value is 0 in the key-value pair in the search set map, and then repeatedly create nodes, retrieve follow-up devices, create nodes of follow-up devices, and create In the step of association relationship, until the flag value of all key-value pairs in the set map is 1, then the device node corresponding to the device entity table, the node of the subsequent device, and the association relationship have been created.

In this embodiment, the following steps are also included:

Monitor whether there is equipment change in the PMS system;

If yes, modify the device node and/or the association relationship according to the device entity table and/or the association relationship table.

Wherein, the equipment change includes: any one or more of new equipment, decommissioning of equipment, change of equipment information, and change of associated information between equipment.

When adding new equipment, create a new node according to the equipment entity table, and create an association relationship between the new node and the original node according to the association relationship table.

When a device is decommissioned, delete the device node corresponding to the device, and delete the association relationship between other device nodes and device nodes.

When the device information changes, modify the device node attribute information according to the device entity table.

When the association information between devices changes, the association information between device nodes is modified according to the association relationship table.

After the transformation from the relational database to the graph database is completed, there may be subsequent device changes. At this time, it is possible to monitor whether there is a device change in the PMS system, and then automatically map to the graph database according to the type of device change.

Wherein, the data table information also includes a device record table describing device information. When creating a device node, the device information in the device record table is used as an attribute of the device node and written into the image database.

Example 2:

As shown in Figure 2, different from Embodiment 1, in this embodiment, the following steps are included:

Step 1: Define the device entity table that stores the basic information of the devices in the power distribution topology network as entityTable, define the association relationship table that stores the connection relationship between devices as connectionTable, and other device record tables recordTables that describe device information.

Step 2: Whether the power distribution topology network to be converted contains at least the equipment entity table entityTable and the association relationship table connectionTable, and the equipment entity table has a single primary key; if the current power distribution topology network cannot meet the above conditions, skip to step 15.

Step 3: Traverse the device entity table, create a key-value pair {id:0} according to the primary key id in the table and put it into the collection map, where {id:0} means that the device corresponding to the current id has not yet established a correspondence in the graph database node.

Step 4: Select a key-value pair {k _i :v _i } from the map according to the traversal order of the set map, if v _i =0, record the primary key of the starting node as start=k _i , and set v _i =1, skip Go to step 5; otherwise, skip to step 4 to reselect the next key-value pair.

Step 5: Create a device node node _i in the graph database with the start value as the primary key, search for the device information whose primary key value is start in the device entity table entityTable and device record table recordTables, and use the found information as the device node node _i Attributes are written into the graph database, and the created device node node _i is put into the precursor node queue preNodeQueue.

Step 6: Check whether the precursor node queue preNodeQueue is empty, if the precursor node queue preNodeQueue is empty, check the set map, if the value of all key-value pairs in the set map is 1, then jump to step 11; if the key value in the set map If the value of the pair is not all 1, skip to step 4.

Step 7: If the precursor node queue preNodeQueue is not empty, take out the head node node _p in the precursor node queue preNodeQueue, and record the corresponding node primary key as k _p .

Step 8: Check the association table connectionTable, if there is a successor device connected to the current device, its primary key is k _j and satisfies v _j =0, continue to execute; otherwise, skip to step 6.

Step 9: Create a device node node _j in the graph database with the value of k _j as the primary key, look up the device information with the primary key value of k _j in the device entity table entityTable and device record table recordTables, and use the found information as the device node The attributes of node _j are written into the graph database.

Step 10: Create an association relationship between device node _i and device node _j in the graph database, put the created device node node _j into the precursor node queue preNodeQueue, and skip to step 8.

Step 11: Monitor the modification request received in the PMS system, if the received modification request is a device connection change, then go to step 12, if the received modification request is a device attribute change, then go to step 14.

Step 12: If the received request is a new device request, obtain the device information from the request and create a new node node _m , the primary key is k _m , then obtain the primary key of the precursor device of the new device as k _l , and search for the node in the graph database node _l , create an association relationship between node node _l and node _m .

Step 13: If the received request is a device disconnection or device decommissioning request, obtain the node primary key k _t corresponding to the device in the graph database from the request, and remove the association between the device node node _t and other device nodes in the graph database . Skip to step 11 when done.

Step 14: From the node primary key k _u corresponding to the device in the graph database in the request, find the device node node _u in the graph database, and update the attribute information of the device node node _u according to the request field. Skip to step 11 when done.

Step 15: The automatic conversion and mapping from distribution network topology to graphic data fails, and the conversion and mapping end.

The present invention obtains the data table information in the relational database, then creates a device node according to the device entity table, the association relationship table and the primary key, and searches whether there is a successor device based on the created device node, and if there is a successor device, then judges the successor device Whether the device has created a device node, if the device node has been created, create an association between nodes, if not, create a new node, and then create an inter-node association, and finally all the device information in the relational database Device nodes are generated in the graph database, and association relationships are created between nodes, so that the distribution network topology in the relational database is automatically converted into a graph in the graph database without changing the existing smart grid system as much as possible data, and can complete automatic mapping, providing a more efficient and intuitive database for subsequent correlation analysis, data retrieval, etc.

Please refer to FIG. 3 which is a schematic structural diagram of a computer device provided by an embodiment of the present application. A computer device 400 provided in an embodiment of the present application includes: a processor 410 and a memory 420 , the memory 420 stores a computer program executable by the processor 410 , and the computer program executes the above method when executed by the processor 410 .

The embodiment of the present application also provides a storage medium 430, on which a computer program is stored, and when the computer program is run by the processor 410, the above method is executed.

Wherein, the storage medium 430 can be implemented by any type of volatile or non-volatile storage device or their combination, such as Static Random Access Memory (Static _Random Access Memory, referred to as SRAM), electrically erasable and programmable Read memory (Electr _i cally Erasable Programmable Read-Only Memory, EE _P ROM for short ₎ , Erasable Programmable Read Only Memory (EPROM for short), Programmable Red-Only Memory (Programmable Red-Only Memory , referred to as PROM), read-only memory (Read-OnlyMemory, referred to as ROM), magnetic memory, flash memory, magnetic disk or optical disk.

In the description of the present invention, the terms "first" and "second" are used for descriptive purposes only, and cannot be understood as indicating or implying relative importance or implicitly indicating the quantity of indicated technical features. Thus, a feature defined as "first" and "second" may explicitly or implicitly include one or more of these features. "Plurality" means two or more, unless otherwise clearly and specifically defined.

In the present invention, unless otherwise clearly specified and limited, terms such as "installation", "connection", "connection" and "fixation" should be understood in a broad sense, for example, it can be a fixed connection or a detachable connection , or integrated; it can be mechanically connected or electrically connected; it can be directly connected or indirectly connected through an intermediary, and it can be the internal communication of two components or the interaction relationship between two components. Those of ordinary skill in the art can understand the specific meanings of the above terms in the present invention according to specific situations.

In the description of this specification, descriptions with reference to the terms "one embodiment", "some embodiments", "example", "specific examples", or "some examples" mean that specific features described in connection with the embodiment or example , structure, material or feature is included in at least one embodiment or example of the present invention. In this specification, the schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the described specific features, structures, materials or characteristics may be combined in any suitable manner in any one or more embodiments or examples. In addition, those skilled in the art can combine and combine different embodiments or examples and features of different embodiments or examples described in this specification without conflicting with each other.

Any process or method descriptions in flowcharts or otherwise described herein may be understood to represent modules, segments or portions of code comprising one or more executable instructions for implementing specific logical functions or steps of the process , and the scope of preferred embodiments of the invention includes alternative implementations in which functions may be performed out of the order shown or discussed, including substantially concurrently or in reverse order depending on the functions involved, which shall It is understood by those skilled in the art to which the embodiments of the present invention pertain.

The logic and/or steps represented in the flowcharts or otherwise described herein, for example, can be considered as a sequenced listing of executable instructions for implementing logical functions, can be embodied in any computer-readable medium, For use with instruction execution systems, devices, or devices (such as computer-based systems, systems including processors, or other systems that can fetch instructions from instruction execution systems, devices, or devices and execute instructions), or in conjunction with these instruction execution systems, devices or equipment used. For the purposes of this specification, a "computer-readable medium" may be any device that can contain, store, communicate, propagate or transmit a program for use in or in conjunction with an instruction execution system, device or device. More specific examples (non-exhaustive list) of computer-readable media include the following: electrical connection with one or more wires (electronic device), portable computer disk case (magnetic device), random access memory (RAM), Read Only Memory (ROM), Erasable Editable Read Only Memory (E _P ROM or Flash Memory), Fiber Optic Devices, and Portable Compact Disc Read Only Memory (CDROM). In addition, the computer-readable medium may even be paper or other suitable medium on which the program can be printed, since the program can be read, for example, by optically scanning the paper or other medium, followed by editing, interpretation or other suitable processing if necessary. The program is processed electronically and stored in computer memory.

It should be understood that various parts of the present invention can be realized by hardware, software, firmware or their combination. In the embodiments described above, various steps or methods may be implemented by software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, it can be implemented by any one or combination of the following techniques known in the art: Discrete logic circuits, ASICs with suitable combinational logic gates, Programmable Gate Arrays ( _PGA ), Field Programmable Gate Arrays (FPGA), etc.

Those of ordinary skill in the art can understand that all or part of the steps carried by the methods of the above embodiments can be completed by instructing related hardware through a program, and the program can be stored in a computer-readable storage medium. During execution, one or a combination of the steps of the method embodiments is included.

The storage medium mentioned above may be a read-only memory, a magnetic disk or an optical disk, and the like. Although the embodiments of the present invention have been shown and described above, it can be understood that the above embodiments are exemplary and should not be construed as limiting the present invention, and those skilled in the art can make the above-mentioned The embodiments are subject to changes, modifications, substitutions and variations.

Claims (15)

1. A method for mapping relational data to graph data, comprising the steps of: Obtain data table information in a relational database, where the data table information at least includes a device entity table, an association table and a primary key; Traversing the device entity table, creating device nodes in the graph database sequentially from the device entity table according to the primary key; Retrieving whether there is a successor device in the association table according to the device node; If there is a subsequent device, retrieve the device entity table of the subsequent device, and determine whether the device node has been created in the graph database; If no device node is created, a new node is created, and an association relationship between nodes is created according to the association relationship table; If the device nodes have been created, an association relationship between nodes is created according to the association relationship table. 2. The method for mapping relational data to graph data according to claim 1, wherein when acquiring the data table information in the relational database, it is judged whether at least the device entity table, the associated relationship table and the primary key are included; If not, stop mapping. 3. The method for mapping relational data to graph data according to claim 2, wherein, when obtaining the data table information in the relational database, it is judged whether the device entity table has a single primary key; If not, stop mapping. 4. The method for mapping relational data to graph data according to claim 1, wherein said creating device nodes sequentially in the image database from said device entity table according to said primary key, comprising: Obtain several key values corresponding to the primary key of the device entity table; Searching for device information in the device entity table and the association relationship table according to the key value; The found device information is written into the image database as an attribute of the device node node _i . 5. The method for mapping relational data to graph data according to claim 4, wherein the searching for device information in the device entity table and the association table according to the key value comprises the following steps: S100: According to the primary key id of the device entity table, create a key-value pair { k _i : v _i }, where k _i is the id of the i -th key value of the primary key, v _i is the tag value of the i -th key value, and The initial value of v _i is 0; S110: Create a collection map , and add the key-value pair { k _i : v _i } to the collection map ; S120: traversing the key-value pairs whose tag values are 0 in the set map in sequence, and searching for the device information; S130: Set the value of the tag value v _i of the traversed key-value pair to 1; S140: judging whether the tag values v _i in the set map are all 1; If not, repeat steps S120 to S130, and if yes, complete the search. 6. The method for mapping relational data to graph data according to claim 5, wherein, according to the device node, when retrieving whether there is a successor device in the association relationship table, the method comprises the following steps: S200: According to the created device node node _i , the key-value pair corresponding to the device node node _i is { k _i : 1}; S210: Add the device node node _i to the precursor queue; S220: Determine whether the precursor queue is empty; S230: If not, take out the head node node _p of the precursor queue, and the primary key value corresponding to the head node node _p is kp ; if so, return to the step _S140 ; S240: Retrieve whether there is a follow-up device of the head node node _p in the association table, the key value of the follow-up device is k _j , and v _j is 0; S250: If yes, then find the device whose key value is k _j in the device entity table, and create a new node node _j ; if not, return to the step S220; S260: Create an association relationship for nodes node _p and node _j according to the association relationship table; S270: Put the node node _j into the precursor queue, and return to the step S240. 7. The method for mapping relational data to graph data according to any one of claims 1 to 6, further comprising the following steps: Monitor whether there is equipment change in the PMS system; If so, modify the device node and/or the association relationship according to the device entity table and/or the association relationship table. 8. The method for mapping relational data to graph data according to claim 7, wherein the device change includes any one of: adding new devices, decommissioning devices, changing device information, and changing related information between devices or more. 9. The method for mapping relational data to graph data according to claim 8, wherein when adding a new device, a new node is created according to the device entity table, and the new node is created according to the association relationship table. The relationship between the new node and the original node. 10. The method for mapping relational data to graph data according to claim 8, wherein when the device is decommissioned, the device node corresponding to the device is deleted, and the association relationship between the remaining device nodes and the device node delete. 11. The method for mapping relational data to graph data according to claim 8, wherein when the device information changes, the attribute information of the device node is modified according to the device entity table. 12. The method for mapping relational data to graph data according to claim 8, wherein when the association information between the devices changes, the association information between the device nodes is modified according to the association relationship table . 13. The method for mapping relational data to graph data according to claim 1, wherein the data table information further includes a device record table describing device information, and when the device node is created, the device record The device information in the table is written into the image database as the attribute of the device node. 14. A computer device, comprising a memory, a processor, and a computer program stored on the memory and operable on the processor, characterized in that, when the processor executes the computer program, the computer program according to claims 1-13 is realized any one of the methods described. 15. A storage medium on which a computer program is stored, wherein when the computer program is executed by a processor, the method according to any one of claims 1-13 is implemented.

Images