CN111581446A

CN111581446A - Graph relation generation method, device, system, equipment and storage medium

Info

Publication number: CN111581446A
Application number: CN202010387366.4A
Authority: CN
Inventors: 张健
Original assignee: Beijing Kingsoft Cloud Network Technology Co Ltd
Current assignee: Beijing Kingsoft Cloud Network Technology Co Ltd
Priority date: 2020-05-09
Filing date: 2020-05-09
Publication date: 2020-08-25
Anticipated expiration: 2040-05-09
Also published as: CN111581446B

Abstract

The embodiment of the disclosure provides a graph relation generation method, a graph relation generation device, a graph relation generation system, graph relation generation equipment and a storage medium, and relates to the technical field of cloud computing data processing, wherein the graph relation generation method comprises the following steps: receiving a graph relation generation request sent by a source physical node; feeding back a graph relation first-stage setting notice to the source physical node; receiving a graph relation second-stage operation notification sent by the source physical node; and sending a graph relation second-stage setting notice to the target physical node according to the information of the target vertex data and the information of the target physical node to prompt the generation of the graph relation to be generated. By applying the scheme provided by the embodiment of the disclosure to generate the graph relationship, the completeness of the generated graph relationship can be ensured.

Description

Graph relation generation method, device, system, equipment and storage medium

Technical Field

The present disclosure relates to the field of data processing technologies, and in particular, to a graph relationship generation method, apparatus, system, device, and storage medium.

Background

The graph database is an OLAP (Online Analytical Processing) type database based on graph topology, and direct or indirect incidence relation between graph data in the graph database can be efficiently obtained in real time based on the graph database. Therefore, graph databases are widely applied in the fields of social networks, business relationship analysis, knowledge graphs, internet of things and the like.

However, as graph databases are widely used, the graph databases store more data, and the computation delay requirement based on the graph databases is higher, and for this reason, distributed graph databases are produced. When data is stored in a distributed graph database, in addition to storing graph data, it is necessary to generate graph relationships between graph data and store the graph relationship data. Currently, each physical node can only set graph relation data for graph data stored by the physical node based on distributed transactions supported by a distributed graph database, that is, the graph relation can only be generated for two graph data stored by the physical node. However, the distributed graph database is jointly stored by a plurality of distributed physical nodes, and two graph data to be generated into a graph relationship may be stored in different physical nodes, so that it is difficult to ensure that the two physical nodes set graph relationship data for the stored graph data when the graph relationships respectively stored in different physical nodes are generated by applying the above method, thereby resulting in incomplete graph relationship between the two graph data.

Disclosure of Invention

The embodiment of the disclosure aims to provide a graph relation generation method, a graph relation generation device, a graph relation generation system, a graph relation generation device and a storage medium, so that the generated graph relation is complete.

In a first aspect, an embodiment of the present disclosure provides a graph relationship generation method, which is applied to an information processing device, and the method includes:

receiving a graph relation generation request sent by a source physical node, wherein the graph relation generation request comprises information of target vertex data of a graph relation to be generated and information of a target physical node storing the target vertex data, and the source physical node and the target physical node are as follows: a physical node for storing a distributed graph database;

feeding back a graph relation first-stage setting notice to the source physical node, so that the source physical node associates source vertex data stored in the source physical node with the graph relation to be generated, sets the direction of the graph relation to be generated relative to the source vertex data, and sets information of the target vertex data and information of the target physical node aiming at the graph relation to be generated;

receiving a graph relation second-stage operation notification sent by the source physical node;

sending a graph relation second-stage setting notification to the target physical node according to the information of the target vertex data and the information of the target physical node to prompt the generation of the graph relation to be generated, so that the target physical node associates the target vertex data with the graph relation to be generated, sets the direction of the graph relation to be generated relative to the target vertex data, and sets the information of the source vertex data and the information of the source physical node aiming at the graph relation to be generated.

In an embodiment of the present disclosure, the graph relationship generation request further includes information of the source vertex data and information of the source physical node;

before the feeding back the graph relation first-stage setting notification to the source physical node, the method further includes:

persistently storing the graph relationship generation request;

in the event that the graph relationship generation request is successfully persisted, performing the step of feeding back graph relationship first stage setup notifications to the source physical node.

In an embodiment of the present disclosure, the graph relationship generating method further includes:

receiving a relation deletion notification sent when the source physical node fails to determine that the relation between the source vertex data and the graph relation to be generated is related;

deleting the graph relationship generation request which is stored persistently.

In a second aspect, an embodiment of the present disclosure provides a graph relationship generation method, applied to a source physical node storing a distributed graph database, where the method includes:

sending a graph relation generation request to the information processing apparatus; the graph relation generating request comprises information of target vertex data of a graph relation to be generated and information of target physical nodes for storing the target vertex data, wherein the target physical nodes are physical nodes for storing a distributed graph database;

receiving graph relation first-stage setting notification fed back by the information processing equipment;

associating source vertex data stored in the source physical node with the graph relation to be generated, setting the direction of the graph relation to be generated relative to the source vertex data, and setting information of the target vertex data and information of the target physical node aiming at the graph relation to be generated;

sending a graph relation second-stage operation notification to the information processing device to prompt the generation of the graph relation to be generated, so that the information processing device informs the target physical node to associate the target vertex data with the graph relation to be generated according to the information of the target vertex data and the information of the target physical node, sets the direction of the graph relation to be generated relative to the target vertex data, and sets the information of the source vertex data and the information of the source physical node aiming at the graph relation to be generated.

the graph relationship first stage sets the notification to: and the information processing equipment successfully stores the notification fed back to the source physical node after the graph relation generation request is stored persistently.

In an embodiment of the present disclosure, after the associating the source vertex data stored in the source physical node and the graph relationship to be generated, the method further includes:

judging whether the relationship between the source vertex data and the graph to be generated is successful or not;

if not, the information processing equipment is informed to delete the graph relation generation request which is stored persistently.

In an embodiment of the present disclosure, the sending of the graph relation second stage operation notification to the information processing apparatus to cause the graph relation to be generated includes:

and under the condition that the association between the source vertex data and the graph relation to be generated is judged to be successful, sending a graph relation second-stage operation notification to the information processing equipment to prompt the generation of the graph relation to be generated.

In a third aspect, an embodiment of the present disclosure provides a graph relationship generation method, which is applied to a target physical node storing a distributed graph database, where the method includes:

responding to a graph relation second stage setting notice sent by the information processing equipment, wherein the graph relation second stage setting notice is as follows: the information processing equipment receives a setting notification sent to the target physical node after receiving a graph relation second-stage operation notification sent by a source physical node, wherein the graph relation second-stage operation notification is as follows: the source physical node is associated with locally stored source vertex data and a graph relation to be generated, the direction of the graph relation to be generated relative to the source vertex data is set, and a notice sent to the information processing equipment is set according to the information of the target vertex data stored in the target physical node and the information of the target physical node aiming at the graph relation to be generated, wherein the source physical node is a physical node used for storing a distributed graph database;

and associating the target vertex data with the graph relation to be generated, setting the direction of the graph relation to be generated relative to the target vertex data, and setting the information of the source vertex data and the information of the source physical node aiming at the graph relation to be generated so as to generate the graph relation to be generated.

In a fourth aspect, an embodiment of the present disclosure provides a graph relation generating apparatus, which is applied to an information processing device, and includes:

a generation request receiving module, configured to receive a graph relationship generation request sent by a source physical node, where the graph relationship generation request includes information of target vertex data of a graph relationship to be generated and information of a target physical node storing the target vertex data, and the source physical node and the target physical node are: a physical node for storing a distributed graph database;

a setting notification feedback module, configured to feed back a first-stage setting notification of a graph relationship to the source physical node, so that the source physical node associates source vertex data stored in the source physical node with the graph relationship to be generated, sets a direction of the graph relationship to be generated with respect to the source vertex data, and sets information of the target vertex data and information of the target physical node for the graph relationship to be generated;

an operation notification receiving module, configured to receive a graph relationship second-stage operation notification sent by the source physical node;

and the setting notification sending module is used for sending a graph relationship second-stage setting notification to the target physical node according to the information of the target vertex data and the information of the target physical node to prompt the generation of the graph relationship to be generated, so that the target physical node associates the target vertex data and the graph relationship to be generated, sets the direction of the graph relationship to be generated relative to the target vertex data, and sets the information of the source vertex data and the information of the source physical node aiming at the graph relationship to be generated.

the device further comprises:

a generation request storage module, configured to persistently store the graph relationship generation request before the setting notification feedback module feeds back the graph relationship first-stage setting notification to the source physical node; and triggering the setting notification feedback module under the condition of successfully storing the graph relation generation request in a persistent mode.

In an embodiment of the present disclosure, the graph relation generating apparatus further includes:

a deletion notification receiving module, configured to receive a relationship deletion notification sent when the source physical node fails to determine that the relationship between the source vertex data and the graph to be generated is associated;

and the generation request deleting module is used for deleting the graph relation generation request which is stored persistently.

In a fifth aspect, an embodiment of the present disclosure provides a graph relation generating apparatus, applied to a source physical node storing a distributed graph database, where the apparatus includes:

a generation request sending module for sending a graph relation generation request to the information processing device; the graph relation generating request comprises information of target vertex data of a graph relation to be generated and information of target physical nodes for storing the target vertex data, wherein the target physical nodes are physical nodes for storing a distributed graph database;

a setting notification receiving module, configured to receive a graph relation first-stage setting notification fed back by the information processing apparatus;

the source vertex association module is used for associating the source vertex data stored in the source physical node with the graph relation to be generated;

the source vertex data setting module is used for setting the direction of the graph relation to be generated relative to the source vertex data and setting the information of the target vertex data and the information of the target physical node aiming at the graph relation to be generated;

and the operation notification sending module is used for sending a second-stage operation notification of graph relationship to the information processing equipment to prompt the generation of the graph relationship to be generated, so that the information processing equipment informs the target physical node to associate the target vertex data with the graph relationship to be generated according to the information of the target vertex data and the information of the target physical node, sets the direction of the graph relationship to be generated relative to the target vertex data, and sets the information of the source vertex data and the information of the source physical node aiming at the graph relationship to be generated.

the data association judging module is used for judging whether the association between the source vertex data and the graph relation to be generated is successful or not after the source vertex association module associates the source vertex data stored in the source physical node and the graph relation to be generated; if not, the information processing equipment is informed to delete the graph relation generation request which is stored persistently.

In an embodiment of the present disclosure, the data association determining module is specifically configured to trigger the operation notification sending module when determining that the relationship between the source vertex data and the graph to be generated is successfully associated.

In a sixth aspect, an embodiment of the present disclosure provides a graph relation generating apparatus, applied to a target physical node storing a distributed graph database, where the apparatus includes:

a setting notification receiving module, configured to respond to a graph relationship second-stage setting notification sent by an information processing apparatus, where the graph relationship second-stage setting notification is: the information processing equipment receives a setting notification sent to the target physical node after receiving a graph relation second-stage operation notification sent by a source physical node, wherein the graph relation second-stage operation notification is as follows: the source physical node is associated with locally stored source vertex data and a graph relation to be generated, the direction of the graph relation to be generated relative to the source vertex data is set, and a notice sent to the information processing equipment is set according to the information of the target vertex data stored in the target physical node and the information of the target physical node aiming at the graph relation to be generated, wherein the source physical node is a physical node used for storing a distributed graph database;

and the target vertex association module is used for associating the target vertex data with the graph relation to be generated, setting the direction of the graph relation to be generated relative to the target vertex data, setting the information of the source vertex data and the information of the source physical node aiming at the graph relation to be generated, and further generating the graph relation to be generated.

In a seventh aspect, an embodiment of the present disclosure provides a graph relation generating system, where the system includes: physical nodes and information processing apparatus for storing a distributed graph database, wherein,

a source physical node of the physical nodes, configured to send a graph relationship generation request to the information processing apparatus; the graph relation generation request comprises information of target vertex data of a graph relation to be generated and information of a target physical node storing the target vertex data in the physical nodes, and the source physical node is as follows: a physical node storing source vertex data of the graph relationship;

the information processing device is used for feeding back a graph relation first-stage setting notification to the source physical node after receiving the graph relation generation request;

the source physical node is further configured to, after receiving the graph relation first-stage setting notification, associate the source vertex data with the graph relation to be generated, set a direction of the graph relation to be generated with respect to the source vertex data, set information of the target vertex data and information of the target physical node for the graph relation to be generated, and send a graph relation second-stage operation notification to the information processing device;

the information processing equipment is further used for sending a graph relation second-stage setting notification to the target physical node according to the information of the target vertex data and the information of the target physical node after receiving the graph relation second-stage operation notification;

and the target physical node is used for associating the target vertex data with the graph relation to be generated, setting the direction of the graph relation to be generated relative to the target vertex data, setting the information of the source vertex data and the information of the source physical node aiming at the graph relation to be generated and further generating the graph relation to be generated after receiving the graph relation second-stage setting notice.

the information processing device is specifically configured to persistently store the graph relationship generation request before feeding back a graph relationship first-stage setting notification to the source physical node; and feeding back a graph relation first-stage setting notice to the source physical node under the condition that the graph relation generation request is successfully stored in a persistent mode.

In an embodiment of the present disclosure, the source physical node is specifically configured to, after associating the source vertex data stored in the source physical node with the graph relationship to be generated, determine whether associating the source vertex data with the graph relationship to be generated is successful; if not, sending a relation deletion notification to the information processing equipment;

the information processing apparatus is further configured to delete the graph relationship generation request that has been persistently stored, after receiving the relationship deletion notification.

In an embodiment of the present disclosure, the source physical node is specifically configured to send a graph relation second-stage operation notification to the information processing apparatus, when it is determined that the relationship between the source vertex data and the graph relation to be generated is successful.

In an eighth aspect, an embodiment of the disclosure provides an information processing apparatus comprising a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor, the processor being caused by the machine-executable instructions to: implementing the method steps of any of the above first aspects.

In a ninth aspect, an embodiment of the present disclosure provides a storage device, where the storage device is a source physical node in a storage device that stores a distributed graph database, where source vertex data of a graph relationship to be generated is stored, and the storage device includes: a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor, the processor being caused by the machine-executable instructions to: implementing the method steps of any of the second aspects.

In a tenth aspect, an embodiment of the present disclosure provides a storage device, where the storage device is a target physical node in which target vertex data of a graph relationship to be generated is stored in a storage device that stores a distributed graph database, and the storage device includes: a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor, the processor being caused by the machine-executable instructions to: the method steps of the third aspect are implemented.

In an eleventh aspect, the present disclosure provides a machine-readable storage medium, in which a computer program is stored, and the computer program, when executed by a processor, implements the method steps of any one of the above first aspects.

In a twelfth aspect, the disclosed embodiments provide a machine-readable storage medium, in which a computer program is stored, and the computer program, when executed by a processor, implements the method steps of any of the second aspects.

In a thirteenth aspect, the disclosed embodiments provide a machine-readable storage medium, in which a computer program is stored, and the computer program, when executed by a processor, implements the method steps of the third aspect.

In a fourteenth aspect, embodiments of the present disclosure also provide a computer program product including instructions, which when run on a computer, cause the computer to perform the method steps of any one of the first, second or third aspects described above.

As can be seen from the above, in the scheme provided by the embodiments of the present disclosure, the graph relationship between the source vertex data stored in the source physical node and the target vertex data stored in the target physical node is generated dominantly by the information processing apparatus. Specifically, in the process of generating the graph relationship, after determining that the source physical node associates the source vertex data with the graph relationship to be generated and setting the direction of the graph relationship to be generated with respect to the source vertex data, and setting information of the target vertex data and information of the target physical node for the graph relationship to be generated, that is, after setting the side data, the information processing apparatus notifies the target physical node, so that the target physical node can associate the target vertex data with the graph relationship to be generated, and set the direction of the graph relationship to be generated with respect to the target vertex data, and set information of the source vertex data and information of the source physical node for the graph relationship to be generated, that is, set the side data, so that the graph relationship to be generated is successfully generated. Therefore, in the process, not only the source physical node sets the edge data of the source vertex data stored in the source physical node, that is, the graph relation data, but also the target physical node sets the edge data of the target vertex data stored in the target physical node, that is, the graph relation data, so that the graph relation between the source vertex data and the target vertex data is generated. Meanwhile, because the graph data at the two ends of the graph relation are associated with the graph relation and the edge-out data and the edge-in data are set, the scheme provided by the embodiment of the disclosure can ensure the integrity of the generated graph relation.

Drawings

In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present disclosure, and other drawings can be obtained by those skilled in the art without creative efforts.

Fig. 1 is a schematic structural diagram of a graph relationship generation system according to an embodiment of the present disclosure;

fig. 2a is a signaling diagram of a first graph relation generating system according to an embodiment of the present disclosure;

fig. 2b is a signaling diagram of a second graph relation generating system according to the embodiment of the present disclosure;

fig. 2c is a signaling diagram of a third graph relation generating system according to the embodiment of the disclosure;

fig. 3 is a schematic flowchart of a first graph relation generation method according to an embodiment of the present disclosure;

fig. 4 is a schematic flowchart of a second graph relation generation method according to an embodiment of the present disclosure;

fig. 5 is a schematic flow chart diagram of a third graph relationship generation method according to the embodiment of the present disclosure;

fig. 6 is a schematic structural diagram of a first graph relation generating apparatus according to an embodiment of the present disclosure;

fig. 7 is a schematic structural diagram of a second graph relation generating device according to an embodiment of the present disclosure;

fig. 8 is a schematic structural diagram of a third graph relation generating apparatus according to an embodiment of the present disclosure;

fig. 9 is a schematic structural diagram of an information processing apparatus according to an embodiment of the present disclosure;

fig. 10 is a schematic structural diagram of a first storage device according to an embodiment of the present disclosure;

fig. 11 is a schematic structural diagram of a second storage device according to an embodiment of the present disclosure.

Detailed Description

The technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure, and it is obvious that the described embodiments are only a part of the embodiments of the present disclosure, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments disclosed herein without making any creative effort, shall fall within the protection scope of the present disclosure. In addition, the embodiments described below are only used for illustrating and explaining technical solutions provided by the embodiments of the present disclosure, and are not used for limiting the present disclosure. And the embodiments and features of the embodiments in the present disclosure may be combined with each other without conflict.

In order to solve the technical problem, embodiments of the present disclosure provide a method, an apparatus, a system, a device, and a storage medium for generating a graph relationship, in which a generated graph relationship is incomplete when generating a graph relationship between graph data stored in two different physical nodes in the prior art.

The following respectively describes in detail a graph relationship generation system, a graph relationship generation method, a graph relationship generation apparatus, an information processing apparatus, a storage apparatus, and a machine-readable storage medium provided in the embodiments of the present disclosure.

First, a diagram relationship generation system provided by the embodiment of the present disclosure is described with reference to fig. 1 and fig. 2 a.

Referring to fig. 1, a schematic structural diagram of a graph relationship generation system is provided, and referring to fig. 2a, a schematic signaling diagram of a first graph relationship generation system is provided. As can be seen from fig. 1, the graph relation generation system includes: a physical node for storing a distributed graph database, and an information processing apparatus 101.

Since the graph database referred to in the embodiments of the present disclosure is a distributed graph database, the distributed graph database is stored in at least two physical nodes, and thus, the graph relationship generation system includes at least two physical nodes for storing the distributed graph database.

Specifically, the source physical node 102, the target physical node 103 and the information processing device 101 included in the physical nodes in the graph relationship generation system may complete the graph relationship generation according to an interaction process shown in the signaling diagram of fig. 2 a.

Wherein, the source physical node 102 is: and the physical nodes store the source vertex data of the graph relation to be generated. The target physical node 103 is: and the physical nodes store target vertex data of the graph relation to be generated.

Since graph databases are based on graph topologies, for graph data in graph databases, vertices, attributes of vertices, and edges are key data of the graph data. The vertices correspond to graph data, also referred to as vertex data. For a more intuitive explanation, the concept of graph data entities is introduced, e.g. the graph data entities may be companies, individuals, videos, etc. The graph data entity corresponds to graph data, and thus, the vertices can be considered to correspond to graph data entities, also referred to as vertex data entities. The attribute of the vertex may include information of vertex data corresponding to the vertex, for example, the information of the vertex data may be information of an identifier, a tag, and the like of a vertex data entity corresponding to the vertex data. An edge represents a relationship between two vertices, i.e., a graph relationship between vertex data corresponding to the two vertices, i.e., a graph relationship between two vertex data entities. For graph data in a graph database, if an edge exists between two vertices, it indicates that a graph relationship exists between vertex data corresponding to the two vertices, that is, a graph relationship exists between vertex data entities corresponding to the two vertices. In addition, the above graph relationship may be described by graph relationship data. Specifically, from an edge perspective, the graph relationship data may include in-edge data and out-edge data.

The information processing apparatus 101 may correspond to a highly available apparatus cluster. For example, the information processing apparatus 101 may be an electronic apparatus as a message middleware, and the information processing apparatus 101 may be a transaction governor.

The specific interaction process is as follows:

the source physical node 102 is configured to transmit a graph relationship generation request to the information processing apparatus 101 (S201).

The graph relation generation request includes information of target vertex data of the graph relation to be generated and information of the target physical node 103.

The information processing apparatus 101 is configured to feed back a graph relationship first stage setting notification to the source physical node 102 after receiving the graph relationship generation request (S202).

The source physical node 102 is further configured to, after receiving the graph relationship first-stage setting notification, associate the source vertex data with the graph relationship to be generated, set edge data of the graph relationship to be generated (S203), and send a graph relationship second-stage operation notification to the information processing apparatus (204).

Wherein, the data of going out the limit includes: the graph relationship to be generated is relative to the direction of the source vertex data, the information of the target vertex data and the information of the target physical node.

For example, the information of the target vertex data may be information such as an identifier and a tag of a vertex data entity corresponding to the target vertex data, or may be an identifier of the target vertex data. The information of the target physical node may be identification, label, address, etc. information of the target physical node.

That is, setting the edge data of the graph relationship to be generated means setting the direction of the graph relationship to be generated with respect to the source vertex data, and setting information of the target vertex data and information of the target physical node for the graph relationship to be generated.

The information processing apparatus 101, upon receiving the graph relation second stage operation notification, is further configured to send a graph relation second stage setting notification to the target physical node 103 according to the information of the target vertex data and the information of the target physical node (S205).

The target physical node 103 is configured to, after receiving the second-stage graph relationship setting notification, associate the target vertex data with the graph relationship to be generated, and set entry data of the graph relationship to be generated, thereby generating the graph relationship to be generated (S206).

That is, after the source physical node 102 associates the source vertex data with the graph relationship to be generated and sets the edge data of the graph relationship to be generated, the target physical node 103 associates the target vertex data with the graph relationship to be generated and sets the edge data of the graph relationship to be generated, it indicates that the graph relationship to be generated is successfully generated, that is, the graph relationship between the source vertex data and the target vertex data is successfully generated.

Wherein, the data of entering the limit includes: the graph relationship to be generated is relative to the direction of the target vertex data, the information of the source vertex data and the information of the source physical node.

For example, the information of the source vertex data may be information such as an identifier and a tag of a vertex data entity corresponding to the source vertex data, or may be an identifier of the source vertex data. The information of the source physical node may be identification, label, address, etc. information of the source physical node.

That is, setting the incoming data of the graph relationship to be generated means setting the direction of the graph relationship to be generated with respect to the target vertex data, and setting the information of the source vertex data and the information of the source physical node for the graph relationship to be generated.

As can be seen from the above interaction process, when generating a graph relationship between source vertex data stored in the source physical node 102 and target vertex data stored in the target physical node 103, the source physical node 102 does not directly disassociate the source vertex data graph and the graph relationship to be generated, but the information processing apparatus 101 dominates whether to start generating the graph relationship. Although the generation of the graph relationship is initiated by the source physical node 102 when there is a need for generating the graph relationship, the source physical node 102 performs operations such as association of source vertex data with the graph relationship to be generated, setting of outgoing edge data, and the like only after the information processing apparatus 101 agrees to generate the graph relationship. This facilitates the information processing apparatus 101 to monitor and manage the entire graph relation generation process.

In one embodiment of the present disclosure, after receiving the graph relationship generation request, the information processing apparatus 101 may check information included in the graph relationship generation request, for example, whether the target vertex data is graph data stored in the target physical node or not.

In addition, the information processing apparatus 101 can also persistently store the graph relationship generation request, so that even if the information processing apparatus 101 encounters a power failure or the like, the information processing apparatus 101 can be guaranteed to know information such as generated graph relationships and non-generated graph relationships after recovering normal operation.

Since the graph relationship corresponds to the key information of "edge" in the key data of the graph database, the source vertex data and the graph relationship to be generated are associated, and the target vertex data and the graph relationship to be generated are associated, that is, the vertex corresponding to the source vertex data and the edge corresponding to the graph relationship to be generated are associated, and the vertex corresponding to the target vertex data and the edge corresponding to the graph relationship to be generated are associated.

The graph relationship to be generated is the relationship between the source vertex data and the target vertex data, and the graph relationship is pointed to by the source vertex data to the target vertex data. That is, the graph relationship is based on the source vertex data and the target vertex data is ultimately reached. In view of this, the graph relationship to be generated included in the edge data with respect to the direction of the source vertex data is the direction from the source vertex data. And the direction of the graph relation to be generated in the edge data relative to the target vertex data is pointed to the target vertex data.

Assume that the source vertex data is: the graph data M corresponding to the company A, the target vertex data are as follows: and the graph data N corresponds to the company B, if the capital flow exists between the company A and the company B, and the capital flows from the company A to the company B. The graph relationship between the source vertex data and the target vertex data may be expressed as:

graph data M- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

The direction of the graph relation to be generated in the edge data relative to the source vertex data is as follows: the direction of the outflow from the graph data M, the direction of the graph relationship to be generated included in the edge data with respect to the target vertex data, is: the direction of the inflow of graph data N.

Since the graph relation generation request contains information of the target physical node, the information processing apparatus 101 can determine the target physical node. In addition, the information processing apparatus 101 may also carry information of the target vertex data in the graph relationship second stage setting notification, and send the notification to the target physical node 103, so that after receiving the graph relationship second stage setting notification, the target physical node 103 may analyze the information of the target vertex data, thereby knowing which graph data needs to be operated.

In one embodiment of the present disclosure, the transmission of messages between the source physical node 102, the target physical node 103, and the information processing device 101 may be implemented based on a distributed transaction architecture for reliable messages.

In one embodiment of the present disclosure, the source physical node 102 sends the graph relationship generation request to the information processing apparatus 101 in a batch manner, that is, the source physical node 102 may send a plurality of graph relationship generation requests to the information processing apparatus 101 at a time, and the graph relationships requested to be generated by the graph relationship generation requests have source vertex data stored in the source physical node 102. This makes it possible for the information processing apparatus 101 to realize the aggregation processing of the graph relation generation request according to the physical nodes, thereby improving the processing efficiency.

In addition, the information processing apparatus 101 may also transmit the graph relation second stage setting notifications to the target physical node 103 in a batch manner, that is, the information processing apparatus 101 may transmit a plurality of graph relation second stage setting notifications to the target physical node 103 at a time, the graph relation second stage setting notifications notifying that the target vertex data in the generated graph relation is stored in the target physical node 103. Thus, the target physical node 103 can set the aggregation processing of the notification according to the second stage of the graph relation implemented by the physical node, thereby further improving the processing efficiency.

As can be seen from the above, in the scheme provided by the embodiments of the present disclosure, the graph relationship between the source vertex data stored in the source physical node and the target vertex data stored in the target physical node is generated dominantly by the information processing apparatus. Specifically, in the process of generating the graph relationship, after determining that the source physical node associates the source vertex data with the graph relationship to be generated and setting the direction of the graph relationship to be generated with respect to the source vertex data, and setting information of the target vertex data and information of the target physical node for the graph relationship to be generated, that is, after setting the side data, the information processing apparatus notifies the target physical node, so that the target physical node can associate the target vertex data with the graph relationship to be generated, and set the direction of the graph relationship to be generated with respect to the target vertex data, and set information of the source vertex data and information of the source physical node for the graph relationship to be generated, that is, set the side data, so that the graph relationship to be generated is successfully generated. Therefore, in the process, not only the source physical node sets the edge data of the source vertex data stored in the source physical node, that is, the graph relation data, but also the target physical node sets the edge data of the target vertex data stored in the target physical node, that is, the graph relation data, so that the graph relation between the source vertex data and the target vertex data is generated. Meanwhile, because the graph data at the two ends of the graph relation are associated with the graph relation and the edge-out data and the edge-in data are set, the scheme provided by the embodiment of the disclosure can ensure the integrity of the generated graph relation. In addition, because the graph relationship generated by applying the scheme provided by the embodiment of the disclosure is complete, the interruption of data analysis caused by incomplete graph relationship when data stored in the distributed graph database is applied to data analysis can be reduced, and the distributed transaction performance bottleneck of the distributed graph database caused by incomplete graph relationship can be weakened.

In one embodiment of the present disclosure, referring to fig. 2b, a signaling diagram of a second graph relation generating system is provided. In this embodiment, the graph relation generation request may further include information of the source vertex data and information of the source physical node. In this way, the information processing apparatus 101, upon receiving the map relationship generation request, may also check the source vertex data and the source physical node to check whether the source vertex data is the map data stored in the source physical node.

In the case where the information of the source vertex data, the information of the target vertex data, the information of the source physical node, and the information of the target physical node are carried in the above-described graph relationship generation request, the information processing apparatus 101 can know that this graph relationship generation request is sent thereto by the source physical node 102, and therefore, the information processing apparatus 101 can know who requests the establishment of the graph relationship between which vertex data stored in which two physical nodes.

Such an information processing apparatus 101 may specifically be configured to persistently store the graph relationship generation request (S207) before feeding back the graph relationship first-stage setting notification (S202) to the source physical node; in the case of successful persistent storage of the above-described graph relationship generation request, a graph relationship first-stage setting notification is fed back to the source physical node 101 (S202).

Therefore, the information processing apparatus 101 can realize backup of the graph relation generation request, and even if power failure or the like occurs in the process of generating the graph relation by the information processing apparatus 101, the graph relation can still be regenerated according to the graph relation generation request which is stored persistently after the information processing apparatus 101 recovers to normal operation. In addition, the information processing apparatus 101 can also learn the generated graph relationship in the distributed graph database according to the graph relationship generation request which is stored persistently, and can further monitor and manage the graph relationship conveniently.

Since the information processing apparatus 101 may correspond to an apparatus cluster, when the graph relationship generation request is persistently stored, the graph relationship generation request may be persistently stored in apparatuses in the apparatus cluster, and when data transmission is performed between apparatuses, problems such as transmission errors and write errors may occur during storage may occur, which may cause a failure of the graph relationship generation request. In this case, the graph relation generation flow may be ended.

In an embodiment of the present disclosure, since there are a plurality of physical nodes for storing the distributed graph database, each physical node may become the target physical node, and in order to perform persistent storage on the received graph relationship generation request in a targeted manner, the information processing device 101 may set a message queue for each physical node, so that the graph relationship generation request is stored to the message queue corresponding to the target physical node after receiving the graph relationship generation request, and then persistent storage is performed on the graph relationship generation request according to the order of the requests in the message queue.

In one embodiment of the present disclosure, referring to fig. 2c, a signaling diagram of a third graph relation generating system is provided.

In this embodiment, the source physical node 102 is specifically configured to, after associating the source vertex data stored in the source physical node 101 with the graph relationship to be generated in S203, determine whether associating the source vertex data with the graph relationship to be generated succeeds (S208); if not, a relationship deletion notification is transmitted to the information processing apparatus 101 (S209).

In this case, the information processing apparatus 101 is further configured to delete the graph relationship generation request that has been persistently stored, after receiving the relationship deletion notification (S210).

In another embodiment of the present disclosure, the source physical node 102 is specifically configured to send a graph relation second-stage operation notification to the information processing apparatus 101 (S204) when it is determined that associating the source vertex data with the graph relation to be generated is successful.

Specifically, if the source physical node 102 fails to successfully associate the source vertex data with the graph relationship to be generated, it means that the operation for the source vertex data fails in the process of generating the graph relationship, and the successful association of the source vertex data with the graph relationship to be generated and the successful association of the target vertex data with the graph relationship to be generated are all-missing, so in this case, it may be considered that it is difficult to generate a complete graph relationship between the source vertex data and the target vertex data. In this way, the information processing device 101 deletes the graph relationship generation request which has been stored persistently, so that it can be effectively ensured that the graph relationship generation requests which have been stored persistently are all the graph relationships which have been generated successfully, and further, the information processing device 101 can manage the graph relationships in the distributed graph database conveniently.

In addition, it can be seen from the above embodiments that, the steps in the graph relationship generation process are respectively completed by different devices, and the generation process is dominated by the information processing device 101, so as long as the performance of the information processing device 101 allows, multiple physical nodes can all initiate a graph relationship generation request, so that multiple graph relationships in the distributed graph database can be generated synchronously.

Corresponding to the graph relation generation system, the embodiment of the present disclosure provides a graph relation generation method applied to an information processing apparatus.

Referring to fig. 3, there is provided a flowchart illustrating a first graph relationship generation method applied to an information processing apparatus, the method including the following steps S301 to S304.

S301: and receiving a graph relation generation request sent by the source physical node.

The graph relation generation request comprises information of target vertex data of the graph relation to be generated and information of target physical nodes for storing the target vertex data.

The source physical node and the target physical node are: a physical node for storing a distributed graph database.

S302: and feeding back a first-stage setting notice of the graph relation to the source physical node, so that the source physical node associates the source vertex data stored in the source physical node with the graph relation to be generated, sets the direction of the graph relation to be generated relative to the source vertex data, and sets the information of the target vertex data and the information of the target physical node aiming at the graph relation to be generated.

S303: and receiving a graph relation second-stage operation notification sent by the source physical node.

S304: and sending a graph relation second-stage setting notification to the target physical node according to the information of the target vertex data and the information of the target physical node to prompt the generation of the graph relation to be generated, so that the target physical node associates the target vertex data with the graph relation to be generated, sets the direction of the graph relation to be generated relative to the target vertex data, and sets the information of the source vertex data and the information of the source physical node aiming at the graph relation to be generated.

After the information processing device sends the second-stage graph relationship setting notification to the target physical node, the target physical node can associate the target vertex data and the graph relationship to be generated, and can set the direction of the graph relationship to be generated relative to the target vertex data, and can set the information of the source vertex data and the information of the source physical node for the graph relationship to be generated.

In an embodiment of the present disclosure, the graph relation generation request may further include information of the source vertex data and information of the source physical node. Before the graph relationship first-stage setting notification is fed back to the source physical node in S302, the graph relationship generation request may also be persistently stored, and in the case that the graph relationship generation request is successfully persistently stored, the above S302 is executed.

Therefore, the information processing equipment can realize the backup of the graph relation generation request, and even if the information processing equipment has power failure and the like in the process of generating the graph relation, the graph relation can still be regenerated according to the graph relation generation request which is stored persistently after the information processing equipment recovers normal operation. In addition, the information processing equipment can also know the generated graph relation in the distributed graph database according to the graph relation generation request which is stored persistently, and further can conveniently monitor and manage the graph relation.

In an embodiment of the present disclosure, the graph relationship generating method may further include:

and receiving a relationship deletion notification sent by the source physical node under the condition that the association of the source vertex data and the graph relationship to be generated fails, and deleting the graph relationship generation request which is stored persistently.

If the source physical node fails to successfully associate the source vertex data with the graph relationship to be generated, the operation for the source vertex data fails in the graph relationship generation process, and the successful association of the source vertex data with the graph relationship to be generated and the successful association of the target vertex data with the graph relationship to be generated in the graph relationship generation process are all missing, so that in this case, it can be considered that it is difficult to generate a complete graph relationship between the source vertex data and the target vertex data. Therefore, the information processing equipment deletes the graph relation generation request which is stored persistently, so that the graph relation generation requests which are stored persistently can be effectively ensured to be the graph relation which is generated successfully, and the information processing equipment can further manage the graph relation in the distributed graph database conveniently.

Corresponding to the graph relationship generation system, the embodiment of the present disclosure provides a graph relationship generation method applied to the source physical node.

Referring to FIG. 4, a flowchart of a second graph relationship generation method applied to a source physical node storing a distributed graph database is provided, which includes the following steps S401-S404.

S401: a graph relationship generation request is sent to the information processing apparatus.

The target physical node is a physical node for storing a distributed graph database.

S402: and receiving graph relation first-stage setting notification fed back by the information processing equipment.

In an embodiment of the present disclosure, the graph relation generation request may further include information of the source vertex data and information of the source physical node.

The graph relationship first stage setup notification may be: and the information processing equipment successfully persists the notification fed back to the source physical node after the storage graph relation generation request.

S403: and associating the source vertex data stored in the source physical node with the graph relation to be generated, setting the direction of the graph relation to be generated relative to the source vertex data, and setting the information of the target vertex data and the information of the target physical node aiming at the graph relation to be generated.

S404: sending a graph relation second-stage operation notification to the information processing device to prompt generation of a graph relation to be generated, so that the information processing device informs the target physical node of associating the target vertex data with the graph relation to be generated according to the information of the target vertex data and the information of the target physical node, sets the direction of the graph relation to be generated relative to the target vertex data, and sets the information of the source vertex data and the information of the source physical node for the graph relation to be generated.

After the source physical node sends the second-stage operation notification to the information processing device, the information processing device can send the second-stage setting notification of the graph relationship to the target physical node, and then the target physical node can associate the target vertex data and the graph relationship to be generated, and can set the direction of the graph relationship to be generated relative to the target vertex data, and can set the information of the source vertex data and the information of the source physical node for the graph relationship to be generated.

In an embodiment of the present disclosure, after associating the source vertex data stored in the source physical node with the graph relationship to be generated in S403, it may be further determined whether associating the source vertex data with the graph relationship to be generated succeeds; if not, the information processing equipment is informed to delete the graph relation generation request which is stored persistently.

In another embodiment of the present disclosure, the step S404 may be executed when it is determined that the relationship between the source vertex data and the graph to be generated is successfully associated;

as can be seen from the above, when generating a graph relationship by applying the scheme provided by the embodiment of the present disclosure, if there is a need to generate a graph relationship, a source physical node storing source vertex data may first initiate a graph relationship generation request to an information processing device, and only when the information processing device allows, the source physical node associates the source vertex data with the graph relationship to be generated, sets a direction of the graph relationship to be generated with respect to the source vertex data, and sets information of target vertex data and information of target physical nodes for the graph relationship to be generated, that is, sets edge data. From the perspective of the information processing device, only after the association operation and the setting operation of the source physical node are confirmed to be completed, the target physical node storing the target vertex data is notified to complete association of the target vertex data and the graph relationship to be generated, the direction of the graph relationship to be generated relative to the target vertex data is set, and information of the source vertex data and information of the source physical node are set for the graph relationship to be generated, that is, the embedded-side data is set. In this way, from the whole process of generating the graph relationship, the generation of the graph relationship is initiated by the active physical node, but is dominated by the information processing device, which ensures that not only the source physical node performs edge data setting on the source vertex data stored therein, that is, setting of the graph relationship data, but also the target physical node performs edge data setting on the target vertex data stored therein, that is, setting of the graph relationship data, thereby generating the graph relationship between the source vertex data and the target vertex data. Meanwhile, because the graph data at the two ends of the graph relation are associated with the graph relation and the edge-out data and the edge-in data are set, the scheme provided by the embodiment of the disclosure can ensure the integrity of the generated graph relation.

Corresponding to the graph relationship generation system, the embodiment of the present disclosure provides a graph relationship generation method applied to the target physical node.

Referring to FIG. 5, a flowchart of a third graph relationship generation method applied to a target physical node for storing a distributed graph database is provided, including S501-S502.

S501: the second stage setting notification is in response to the graph relation sent by the information processing apparatus.

Wherein, the notification of the second stage of the graph relation is set as follows: and the information processing equipment receives the setting notification sent to the target physical node after receiving the graph relation second-stage operation notification sent by the source physical node.

The graph relationship second stage operation notification is: the source physical node associates the locally stored source vertex data and the graph relation to be generated, sets the direction of the graph relation to be generated relative to the source vertex data, and sets the information of the target vertex data and the information of the target physical node stored in the target physical node aiming at the graph relation to be generated and then sends a notification to the information processing equipment.

The source physical node is a physical node for storing a distributed graph database.

S502: and associating the target vertex data with the graph relation to be generated, setting the direction of the graph relation to be generated relative to the target vertex data, and setting the information of the source vertex data and the information of the source physical node aiming at the graph relation to be generated so as to generate the graph relation to be generated.

As can be seen from the above, when the graph relationship is generated by applying the scheme provided by the embodiment of the present disclosure, the source physical node associates the source vertex data with the graph relationship to be generated, and sets the direction of the graph relationship to be generated with respect to the source vertex data, and after the information of the target vertex data and the information of the target physical node are set for the graph relationship to be generated, that is, after the edge data is set, the information processing device notifies the target physical node to associate the target vertex data, sets the direction of the graph relationship to be generated with respect to the target vertex data, and sets the information of the source vertex data and the information of the source physical node for the graph relationship to be generated, that is, sets the edge data, so that not only the graph relationship between the source vertex data and the target vertex data is generated, but also the integrity of the generated graph relationship is ensured.

Corresponding to the graph relation generation method applied to the information processing device, the embodiment of the disclosure also provides a graph relation generation device applied to the information processing device.

Referring to fig. 6, there is provided a schematic structural diagram of a first graph relation generating apparatus, applied to an information processing device, the apparatus including:

a generation request receiving module 601, configured to receive a graph relationship generation request sent by a source physical node, where the graph relationship generation request includes information of target vertex data of a graph relationship to be generated and information of a target physical node storing the target vertex data, and the source physical node and the target physical node are: a physical node for storing a distributed graph database;

a setting notification feedback module 602, configured to feed back a first-stage setting notification of a graph relationship to the source physical node, so that the source physical node associates source vertex data stored in the source physical node with the graph relationship to be generated, sets a direction of the graph relationship to be generated with respect to the source vertex data, and sets information of the target vertex data and information of the target physical node for the graph relationship to be generated;

an operation notification receiving module 603, configured to receive a graph relationship second-stage operation notification sent by the source physical node;

a setting notification sending module 604, configured to send a second-stage setting notification of a graph relationship to the target physical node according to the information of the target vertex data and the information of the target physical node, so as to enable the target physical node to associate the target vertex data with the graph relationship to be generated, set a direction of the graph relationship to be generated with respect to the target vertex data, and set the information of the source vertex data and the information of the source physical node for the graph relationship to be generated.

the device further comprises:

In one embodiment of the present disclosure, the apparatus further comprises:

Corresponding to the graph relationship generation method applied to the source physical node, the embodiment of the disclosure further provides a graph relationship generation device applied to the source physical node.

Referring to fig. 7, a schematic structural diagram of a second graph relation generating apparatus for storing a source physical node of a distributed graph database is provided, the apparatus including:

a generation request sending module 701 configured to send a graph relationship generation request to the information processing apparatus; the graph relation generating request comprises information of target vertex data of a graph relation to be generated and information of target physical nodes for storing the target vertex data, wherein the target physical nodes are physical nodes for storing a distributed graph database;

a setting notification receiving module 702, configured to receive a graph relation first-stage setting notification fed back by the information processing apparatus;

a source vertex associating module 703, configured to associate the source vertex data stored in the source physical node with the graph relationship to be generated;

a source vertex data setting module 704, configured to set a direction of the graph relationship to be generated with respect to the source vertex data, and set information of the target vertex data and information of the target physical node for the graph relationship to be generated;

an operation notification sending module 705, configured to send a graph relationship second-stage operation notification to the information processing apparatus, so as to cause the information processing apparatus to notify the target physical node to associate the target vertex data with the graph relationship to be generated according to the information of the target vertex data and the information of the target physical node, set a direction of the graph relationship to be generated with respect to the target vertex data, and set the information of the source vertex data and the information of the source physical node for the graph relationship to be generated.

In one embodiment of the present disclosure, the apparatus further comprises:

In an embodiment of the present disclosure, the data association determining module is specifically configured to trigger the operation notification sending module 705 when determining that the relationship between the source vertex data and the graph to be generated is successfully associated.

Corresponding to the graph relationship generating device applied to the target physical node, the embodiment of the disclosure also provides a graph relationship generating device applied to the target physical node.

Referring to fig. 8, a schematic structural diagram of a third graph relation generating apparatus for storing a target physical node of a distributed graph database is provided, the apparatus including:

a setting notification receiving module 801, configured to respond to a graph relationship second stage setting notification sent by an information processing apparatus, where the graph relationship second stage setting notification is: the information processing equipment receives a setting notification sent to the target physical node after receiving a graph relation second-stage operation notification sent by a source physical node, wherein the graph relation second-stage operation notification is as follows: the source physical node is associated with locally stored source vertex data and a graph relation to be generated, the direction of the graph relation to be generated relative to the source vertex data is set, and a notice sent to the information processing equipment is set according to the information of the target vertex data stored in the target physical node and the information of the target physical node aiming at the graph relation to be generated, wherein the source physical node is a physical node used for storing a distributed graph database;

a target vertex associating module 802, configured to associate the target vertex data with the graph relationship to be generated, set a direction of the graph relationship to be generated relative to the target vertex data, and set information of the source vertex data and information of the source physical node for the graph relationship to be generated, so as to generate the graph relationship to be generated.

Corresponding to the graph relation generation method applied to the information processing device, the embodiment of the disclosure also provides the information processing device.

Referring to fig. 9, there is provided a schematic configuration diagram of an information processing apparatus including: a processor 901 and a machine-readable storage medium 902, the machine-readable storage medium 902 storing machine-executable instructions executable by the processor 901, the processor 901 being caused by the machine-executable instructions to: the steps of any graph relation generating method applied to the information processing apparatus described above are implemented.

Corresponding to the graph relation generation method applied to the source physical node, the embodiment of the disclosure further provides a storage device.

Referring to fig. 10, a schematic structural diagram of a storage device is provided, where the storage device is a source physical node in a storage device storing a distributed graph database, where source vertex data of a graph relationship to be generated is stored, and the storage device includes: a processor 1001 and a machine-readable storage medium 1002, the machine-readable storage medium 1002 storing machine-executable instructions executable by the processor 1001, the processor 1001 being caused by the machine-executable instructions to: and implementing the steps of any graph relation generation method applied to the source physical node.

Corresponding to the graph relation generation method applied to the target physical node, the embodiment of the disclosure further provides a storage device.

Referring to fig. 11, a schematic structural diagram of a storage device is provided, where the storage device is a target physical node in a storage device storing a distributed graph database, where target vertex data of a graph relationship to be generated is stored, and the storage device includes: a processor 1101 and a machine-readable storage medium 1102, the machine-readable storage medium 1102 storing machine-executable instructions executable by the processor 1101, the processor 1101 being caused by the machine-executable instructions to: and implementing the steps of any graph relation generation method applied to the target physical node.

In an embodiment of the present disclosure, a machine-readable storage medium is further provided, in which a computer program is stored, and the computer program, when executed by a processor, implements the steps of any graph relation generation method applied to the information processing apparatus.

In an embodiment of the present disclosure, a machine-readable storage medium is further provided, in which a computer program is stored, and the computer program, when executed by a processor, implements the steps of any graph relationship generation method applied to a source physical node.

In an embodiment of the present disclosure, a machine-readable storage medium is further provided, in which a computer program is stored, and the computer program, when executed by a processor, implements the steps of any graph relation generation method applied to a target physical node.

In one embodiment of the present disclosure, there is also provided a computer program product containing instructions which, when run on a computer, cause the computer to execute any of the graph relation generating methods applied to the information processing apparatus described above.

In one embodiment of the present disclosure, there is also provided a computer program product containing instructions which, when run on a computer, cause the computer to perform any of the graph relationship generation methods described above as applied to a source physical node.

In one embodiment of the present disclosure, there is also provided a computer program product containing instructions which, when run on a computer, cause the computer to perform any of the graph relationship generation methods described above as applied to a target physical node.

It should be noted that the machine-readable storage medium may include a Random Access Memory (RAM) or a Non-Volatile Memory (NVM), such as at least one disk Memory. Alternatively, the machine-readable storage medium may be at least one memory device located remotely from the processor.

The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component.

It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.

All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, as for the method, apparatus, information processing device, storage device, and machine-readable storage medium embodiments, since they are substantially similar to the system embodiments, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the system embodiments.

The above description is only for the preferred embodiment of the present disclosure, and is not intended to limit the scope of the present disclosure. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present disclosure are included in the scope of protection of the present disclosure.

Claims

1. A graph relation generating method applied to an information processing apparatus, the method comprising:

2. The method of claim 1,

the graph relation generation request also comprises the information of the source vertex data and the information of the source physical node;

persistently storing the graph relationship generation request;

3. The method of claim 2, further comprising:

4. A graph relationship generation method applied to a source physical node storing a distributed graph database, the method comprising:

5. The method of claim 4,

6. The method of claim 5, further comprising, after said associating source vertex data stored in the source physical node with the graph relationship to be generated:

7. The method according to claim 6, wherein the sending of the graph relation second stage operation notification to the information processing apparatus causes the graph relation to be generated, including:

8. A graph relationship generation method applied to a target physical node storing a distributed graph database, the method comprising:

9. A graph relation generating apparatus applied to an information processing device, the apparatus comprising:

10. The apparatus of claim 9,

the device further comprises:

11. The apparatus of claim 10, further comprising:

12. A graph relationship generation apparatus applied to a source physical node storing a distributed graph database, the apparatus comprising:

13. The apparatus of claim 12,

14. The apparatus of claim 13, further comprising:

15. The apparatus of claim 14,

the data association judging module is specifically configured to trigger the operation notification sending module when judging that the association between the source vertex data and the graph relationship to be generated is successful.

16. A graph relationship generation apparatus applied to a target physical node storing a distributed graph database, the apparatus comprising:

17. A graph relationship generation system, the system comprising: physical nodes and information processing apparatus for storing a distributed graph database, wherein,

18. The system of claim 17,

19. The system of claim 18,

the source physical node is specifically configured to, after associating the source vertex data stored in the source physical node with the graph relationship to be generated, determine whether associating the source vertex data with the graph relationship to be generated is successful; if not, sending a relation deletion notification to the information processing equipment;

20. The system of claim 19,

the source physical node is specifically configured to send a graph relationship second-stage operation notification to the information processing device when it is determined that the relationship between the source vertex data and the graph relationship to be generated is successful.

21. An information processing apparatus comprising a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor, the processor being caused by the machine-executable instructions to: carrying out the method steps of any one of claims 1 to 3.

22. A storage device, wherein the storage device is a source physical node in which source vertex data of a graph relationship to be generated is stored in a storage device that stores a distributed graph database, and the storage device includes: a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor, the processor being caused by the machine-executable instructions to: -carrying out the method steps of any one of claims 4 to 7.

23. A storage device, wherein the storage device is a target physical node in which target vertex data of a graph relationship to be generated is stored in a storage device that stores a distributed graph database, and the storage device includes: a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor, the processor being caused by the machine-executable instructions to: implementing the method steps of claim 8.

24. A machine readable storage medium, characterized in that a computer program is stored in the machine readable storage medium, which computer program, when being executed by a processor, carries out the method steps of any one of the claims 1-3.

25. A machine readable storage medium, characterized in that a computer program is stored in the machine readable storage medium, which computer program, when being executed by a processor, carries out the method steps of any one of the claims 4-7.

26. A machine-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the method steps of claim 8.