CN111737369A - Relationship map updating method and device and storage medium - Google Patents
Relationship map updating method and device and storage medium Download PDFInfo
- Publication number
- CN111737369A CN111737369A CN202010434617.XA CN202010434617A CN111737369A CN 111737369 A CN111737369 A CN 111737369A CN 202010434617 A CN202010434617 A CN 202010434617A CN 111737369 A CN111737369 A CN 111737369A
- Authority
- CN
- China
- Prior art keywords
- entity
- relationship
- node
- graph
- added
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 34
- 230000002776 aggregation Effects 0.000 claims abstract description 233
- 238000004220 aggregation Methods 0.000 claims abstract description 233
- 238000010586 diagram Methods 0.000 description 12
- 238000005516 engineering process Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000004931 aggregating effect Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000007723 transport mechanism Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
- G06F16/288—Entity relationship models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
- G06F16/285—Clustering or classification
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention discloses a method and a device for updating a relation map and a computer readable storage medium, which are used for determining the relation between entities to be added into the relation map; for each relation to be added to the relation map, the following operations are respectively carried out: determining a first entity in the two entities corresponding to the first type and the relationship to be added; when a first entity exists in a relationship graph, if the first entity is associated with a relationship of a first type in the relationship graph, adding an aggregation node in the relationship graph, and pointing the first entity to the aggregation node, wherein the aggregation node refers to a node containing a plurality of relationships of the same type; if the first entity is associated with a plurality of first types of relationships in the relationship graph, updating the aggregation node pointed by the first entity; and after the addition of the relation to be added is finished, determining the entity to be added into the relation map, and adding a corresponding entity node into the relation map. Through the scheme disclosed by the invention, the relationship map can be displayed more simply.
Description
Technical Field
The present invention relates to the field of computers, and in particular, to a method and an apparatus for updating a relationship graph, and a storage medium.
Background
In some technologies, the associated map is generally static, all entities and relations in the map are directly displayed, and readability is poor.
In the application of the knowledge graph, a user can expand a designated entity to display a relationship graph of the designated entity, and in a big data scene, the expanded entities and the association relations among the entities are more, including implicit relations such as direct relations and event-based indirect association relations. This results in a large number of entities and relationships on the relationship graph being presented to the user, affecting the user experience.
Disclosure of Invention
In order to solve the technical problem, the present disclosure provides a method, an apparatus, and a storage medium for updating a relationship graph, which can more concisely display the relationship graph and improve the user experience.
The present disclosure provides a method for updating a relationship graph, including:
determining relationships between entities to be added to the relationship graph;
for each relation to be added to the relation map, the following operations are respectively carried out:
determining a first entity in the two entities corresponding to the first type and the relationship to be added; the first type is a relation type corresponding to the relation to be added;
when the first entity exists in the relationship graph, if the first entity is associated with a relationship of a first type in the relationship graph, adding an aggregation node in the relationship graph, and pointing the first entity to the aggregation node, wherein the aggregation node is a node containing a plurality of relationships of the same type; updating an aggregation node to which the first entity points if the first entity associates a plurality of relationships of a first type in the relationship graph;
and after the addition of the relation to be added is finished, determining the entity to be added into the relation map, and adding a corresponding entity node into the relation map.
In an exemplary embodiment, the determining relationships between entities to be added to the relationship graph includes:
acquiring existing nodes in a relational graph, and determining the type of each node, wherein the nodes comprise: an entity node and an aggregation node, wherein the entity node is a node corresponding to an entity;
when the node is an entity node, acquiring the relationship between the entities related to the entity node in the relationship graph, and adding the acquired relationship into the existing relationship between the entities in the relationship graph;
when the node is an aggregation node, acquiring a relationship which is associated with the aggregation node and points to an entity node from the aggregation node, and adding the relationship to the existing relationship between the entities of the relationship graph;
and removing the relationship between the existing entities of the relationship map from the relationship between the pre-acquired entities to obtain the relationship between the entities to be added into the relationship map.
In an exemplary embodiment, a first entity of the two entities corresponding to the relationship to be added refers to: and when only one entity node exists in the relationship graph of the two entities or when the two entities exist in the relationship graph, determining the entity corresponding to the entity node of the source node according to a preset principle.
In an exemplary embodiment, the adding an aggregation node to the relationship graph, and pointing the first entity to the aggregation node, includes:
adding an aggregation node in a relationship graph, and adding a relationship of the first entity pointing to the added aggregation node in the relationship graph; and taking the opposite end entity node of the first type of relationship existing in the relationship graph and the entity node corresponding to the other entity in the relationship to be added as the entity node associated with the added aggregation node, and taking the first type of relationship existing in the relationship graph and the relationship to be added as the relationship associated with the added aggregation node.
In an exemplary embodiment, for each relationship to be added to the relationship graph, the following operations are further performed respectively:
when the first entity exists in the relationship graph and the other entity does not exist in the relationship graph in the two entities corresponding to the relationship to be added, adding an entity node corresponding to the other entity in the relationship graph, and adding the relationship between the first entity and the other entity in the relationship graph;
adding a relationship between the first entity and the other entity in the relationship graph when both the first entity and the other entity exist in the relationship graph;
when the first entity and the other entity do not exist in the relationship graph, adding entity nodes corresponding to the first entity and the other entity in the relationship graph, and adding the relationship between the first entity and the other entity in the relationship graph.
In an exemplary embodiment, the determining the entity to be added to the relationship graph includes:
acquiring the type of each node in the relation graph;
when the node is an entity node, adding an entity corresponding to the entity node into an existing entity;
when the node is an aggregation node, adding an entity corresponding to an opposite end entity node associated with the aggregation node into an existing entity;
and removing the existing entity from the obtained entity to obtain the entity to be added into the relational graph.
In an exemplary embodiment, the updating the aggregation node to which the first entity points includes:
acquiring an aggregation node pointed by the first entity;
adding the relation to be added into the incidence relation of the aggregation node pointed by the first entity,
and adding the opposite end entity node associated with the relation to be added into the associated node of the aggregation node pointed by the first entity.
In an exemplary embodiment, after determining an entity to be added to the relationship graph and adding a corresponding entity node to the relationship graph, the method further includes:
when an aggregation node in the relationship graph is selected, if the aggregation node is in an aggregation state at present, acquiring a node associated with the aggregation node and an associated relationship, and displaying the node associated with the associated node and the associated relationship on the displayed relationship graph; and if the aggregation node is in the display state, hiding the nodes and the related relations of the aggregation node on the displayed relation graph.
The present disclosure also provides an update apparatus of a relationship graph, including: a memory and a processor;
the memory is used for storing a program for updating the relation map;
the processor is used for reading the program for updating the relation map, and executing the following operations:
determining relationships between entities to be added to the relationship graph;
for each relation to be added to the relation map, the following operations are respectively carried out:
determining a first entity in the two entities corresponding to the first type and the relationship to be added; the first type is a relation type corresponding to the relation to be added;
when the first entity exists in the relationship graph, if the first entity is associated with a relationship of a first type in the relationship graph, adding an aggregation node in the relationship graph, and pointing the first entity to the aggregation node, wherein the aggregation node is a node containing a plurality of relationships of the same type; updating an aggregation node to which the first entity points if the first entity associates a plurality of relationships of a first type in the relationship graph;
determining an entity to be added into the relation graph, and adding a corresponding entity node into the relation graph.
In an exemplary embodiment, the determining relationships between entities to be added to the relationship graph includes:
acquiring existing nodes in a relational graph, and determining the type of each node, wherein the nodes comprise: an entity node and an aggregation node, wherein the entity node is a node corresponding to an entity;
when the node is an entity node, acquiring the relationship between the entities related to the entity node in the relationship graph, and adding the acquired relationship into the existing relationship between the entities in the relationship graph;
when the node is an aggregation node, acquiring a relationship which is associated with the aggregation node and points to an entity node from the aggregation node, and adding the relationship to the existing relationship between the entities of the relationship graph;
and removing the relationship between the existing entities of the relationship map from the relationship between the pre-acquired entities to obtain the relationship between the entities to be added into the relationship map.
In an exemplary embodiment, a first entity of the two entities corresponding to the relationship to be added refers to: and when only one entity node exists in the relationship graph of the two entities or when the two entities exist in the relationship graph, determining the entity corresponding to the entity node of the source node according to a preset principle.
In an exemplary embodiment, the adding an aggregation node to the relationship graph, and pointing the first entity to the aggregation node, includes:
adding an aggregation node in a relationship graph, and adding a relationship of the first entity pointing to the added aggregation node in the relationship graph; and taking the opposite end entity node of the first type of relationship existing in the relationship graph and the entity node corresponding to the other entity in the relationship to be added as the entity node associated with the added aggregation node, and taking the first type of relationship existing in the relationship graph and the relationship to be added as the relationship associated with the added aggregation node.
In an exemplary embodiment, for each relationship to be added to the relationship graph, the processor further performs the following operations:
when the first entity exists in the relationship graph and the other entity does not exist in the relationship graph in the two entities corresponding to the relationship to be added, adding an entity node corresponding to the other entity in the relationship graph, and adding the relationship between the first entity and the other entity in the relationship graph;
adding a relationship between the first entity and the other entity in the relationship graph when both the first entity and the other entity exist in the relationship graph;
when the first entity and the other entity do not exist in the relationship graph, adding entity nodes corresponding to the first entity and the other entity in the relationship graph, and adding the relationship between the first entity and the other entity in the relationship graph.
In an exemplary embodiment, the determining the entity to be added to the relationship graph includes:
acquiring the type of each node in the relation graph;
when the node is an entity node, adding an entity corresponding to the entity node into an existing entity;
when the node is an aggregation node, adding an entity corresponding to an opposite end entity node associated with the aggregation node into an existing entity;
and removing the existing entity from the obtained entity to obtain the entity to be added into the relational graph.
In an exemplary embodiment, the updating the aggregation node to which the first entity points includes:
acquiring an aggregation node pointed by the first entity;
adding the relation to be added into the incidence relation of the aggregation node pointed by the first entity,
and adding the opposite end entity node associated with the relation to be added into the associated node of the aggregation node pointed by the first entity.
In an exemplary embodiment, after determining an entity to be added to the relationship graph and adding a corresponding entity node to the relationship graph, the method further includes:
when an aggregation node in the relationship graph is selected, if the aggregation node is in an aggregation state at present, acquiring a node associated with the aggregation node and an associated relationship, and displaying the node associated with the associated node and the associated relationship on the displayed relationship graph; and if the aggregation node is in the display state, hiding the nodes and the related relations of the aggregation node on the displayed relation graph.
The present disclosure also provides a computer-readable storage medium storing computer-executable instructions for performing the above-mentioned method for updating a relationship map or the operations in any of the exemplary embodiments by a processor.
Compared with the prior art, the embodiment of the disclosure discloses a method and a device for updating a relation graph and a computer-readable storage medium, wherein the method comprises the following steps: determining relationships between entities to be added to the relationship graph; determining a first entity in two entities corresponding to the first type and the relationship to be added; when a first entity exists in a relationship graph, if the first entity is associated with a relationship of a first type in the relationship graph, adding an aggregation node in the relationship graph, and pointing the first entity to the aggregation node, wherein the aggregation node refers to a node containing a plurality of relationships of the same type; if the first entity associates a plurality of first-type relationships in the relationship graph, updating an aggregation node pointed to by the first entity; and determining an entity to be added into the relation graph, and adding a corresponding entity node into the relation graph. Through the scheme disclosed by the invention, the relationship map can be displayed more simply.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
The accompanying drawings are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the example serve to explain the principles of the invention and not to limit the invention.
FIG. 1 is a flowchart of a relationship graph updating method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a relationship map updating apparatus according to an embodiment of the present invention;
FIG. 3 is a diagram illustrating an exemplary relationship graph according to an embodiment of the present invention;
FIG. 4a is a diagram of a relationship map before updating in one embodiment;
fig. 4b is a schematic diagram of a relationship graph after aggregation nodes are added in an example according to the embodiment of the present invention;
fig. 4c is a schematic illustration showing a relationship graph with aggregation nodes added according to an example of the embodiment of the present invention;
FIG. 5a is a diagram illustrating a relationship graph before updating according to an example of the embodiment of the present invention;
FIG. 5b is a diagram illustrating an updated relationship graph in an example of the embodiment of the present invention
FIG. 6a is a diagram illustrating a relationship map before updating in an example of the embodiment of the present invention;
FIG. 6b is a diagram illustrating a relationship map after updating in an example of the embodiment of the present invention;
fig. 7a is a diagram illustrating a relationship map before updating in an example of the embodiment of the present invention;
fig. 7b is a diagram illustrating a relationship map after updating in an example of the embodiment of the present invention;
FIG. 8 is a first diagram illustrating a relationship graph in an example of the embodiment of the present invention;
FIG. 9 is a second illustration of a relationship graph in an example of the embodiment of the present invention;
fig. 10 is a third illustration of a relationship graph in an example of the embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present disclosure more apparent, embodiments of the present invention will be described in detail below with reference to the accompanying drawings. It should be noted that the embodiments and features of the embodiments in the present application may be arbitrarily combined with each other without conflict.
The steps illustrated in the flow charts of the figures may be performed in a computer system such as a set of computer-executable instructions. Also, while a logical order is shown in the flow diagrams, in some cases, the steps shown or described may be performed in an order different than here.
Herein, the representation form of the entity in the relationship graph is an entity node, and the representation form of the relationship is an edge. An entity exists in the relation map, which means that an entity node corresponding to the entity exists in the relation map; one relation exists in the relation map, which means that the corresponding edge of the relation exists in the relation map; an entity is associated with a relationship in a relationship graph, which means that an entity node corresponding to the entity exists as an edge corresponding to the relationship between the entity node and other nodes in the relationship graph.
Fig. 1 is a flowchart of a method for updating a relationship map according to the present disclosure, as shown in fig. 1, including steps 100-102:
determining a first entity in the two entities corresponding to the first type and the relationship to be added; the first type is a relation type corresponding to the relation to be added;
when the first entity exists in the relationship graph, if the first entity is associated with a relationship of a first type in the relationship graph, adding an aggregation node in the relationship graph, and pointing the first entity to the aggregation node, wherein the aggregation node is a node containing a plurality of relationships of the same type; updating an aggregation node to which the first entity points if the first entity associates a plurality of relationships of a first type in the relationship graph;
and 102, after the addition of the relation to be added is finished, determining an entity to be added into the relation graph, and adding a corresponding entity node into the relation graph.
In step 100, relationships between entities to be added to a relationship graph are determined.
In this embodiment, when an entity is expanded, all the expanded entities and the relationships between the entities can be obtained by calling an interface service; traversing the relational graph to obtain all nodes and edges in the relational graph; and determining the relationship among the entities to be added into the relationship map according to the acquired relationship among the entities and all the nodes and edges in the relationship map.
In an exemplary embodiment, existing nodes in a relationship graph are obtained, and a type of each node is determined, wherein the nodes include: an entity node and an aggregation node, wherein the entity node is a node corresponding to an entity; when the node is an entity node, acquiring the relationship between the entities related to the entity node in the relationship graph, and adding the acquired relationship into the existing relationship between the entities in the relationship graph; when the node is an aggregation node, acquiring a relationship which is associated with the aggregation node and points to an entity node from the aggregation node, and adding the relationship to the existing relationship between the entities of the relationship graph; and removing the relationship between the existing entities of the relationship map from the relationship between the pre-acquired entities to obtain the relationship between the entities to be added into the relationship map. As shown in fig. 3, the relationship graph includes 2 types of elements, one type being a node; the other is the connection between nodes, namely edges. The nodes are of 2 types, one is entity and represents entity nodes of the entity, and the other is relationship node and represents aggregation nodes generated after the relationship aggregation. The edges have 3 types, one is relation representing the relationship between entities, the other is nodeRelation representing the edge of the entity pointing to the aggregation node, and the other is relationship ToNode representing the edge of the aggregation node pointing to the entity.
In an exemplary embodiment, a first entity of the two entities corresponding to the relationship to be added refers to: and when only one entity node exists in the relationship graph of the two entities or when the two entities exist in the relationship graph, determining the entity corresponding to the entity node of the source node according to a preset principle. In this embodiment, when only one entity node exists in the relationship graph, the entity node serves as the first entity; when the first entity and the second entity of the two entities corresponding to the relationship to be added exist in the relationship map, the number of edges, which have the same type as the relationship to be added, in the edges associated with the two entity nodes can be inquired through the primary key, and the entities with a large number are used as source nodes; and if the quantity is the same, randomly selecting one entity node as a source node. For example: when the relationship to be added (in-line relationship) is connected with 2 entities A and B, if the entity nodes A and B exist in the relationship map, the number of edges which are the same as the type of the relationship to be added (in-line relationship) in the edges associated with the two entity nodes can be respectively inquired through the primary key; and if the entity node A is associated with one in-line relation, the entity node B is associated with three in-line relations, and the entity node B is determined to be the source node. And if the entity node A and the entity node B are both associated with two same-row relations, randomly selecting the entity node A or the entity node B as a source node.
In step 101, for each relationship to be added to the relationship graph, the following operations are performed: determining a first entity in the two entities corresponding to the first type and the relationship to be added; the first type is a relation type corresponding to the relation to be added; when the first entity exists in the relationship graph, if the first entity is associated with a relationship of a first type in the relationship graph, adding an aggregation node in the relationship graph, and pointing the first entity to the aggregation node, wherein the aggregation node is a node containing a plurality of relationships of the same type; updating an aggregation node to which the first entity points if the first entity associates a plurality of relationships of a first type in the relationship graph.
In this embodiment, the relationship between the entities to be added to the relationship graph is determined in step 100, two entities connected by the current relationship are obtained for each relationship, and the relationship is added according to a corresponding rule according to the difference in the relationship associated with the first entity. As shown in fig. 4a-4c, when the to-be-added relationship (parent-child relationship) connects 2 entities a and B, if the first entity a has an edge R1 with the same relationship type (parent-child relationship), an aggregation node is added in the relationship graph, where the aggregation node includes an entity node array connected nodes associated with the aggregation node and a relationship array connected edges associated with the aggregation node, the connected nodes include opposite end entity nodes corresponding to the association relationship, the connected edges include an opposite end entity a1 and an entity B associated with R1, which are stored in the relationship between entities to be added in the relationship graph, and the connection edges are stored in the relationship graph, to which the entity a points to the aggregation node. For example: when a relationship to be added (parent-child relationship) is connected with 2 entities a and B, if both entity nodes a and B exist in the relationship graph, taking entity node a as a source node for example, if there is a relationship type (i.e. a peer relationship) where one edge is the same as the relationship to be added currently, an aggregation node-peer relationship aggregation node is added in the relationship graph, the node type is relationship node, the connected nodes of the aggregation node store 2 opposite end entity nodes a1 and B corresponding to the relationship (i.e. the peer relationship from a to a1 and the peer relationship from a to B), connected edges store 2 relationship edges of the same type, i.e. the relationship edge system from a to a1 and the relationship edge from a to B, and the relationship graph adds an edge pointing to the aggregation node of entity a, the edge type is nodeRelation.
In one exemplary embodiment, adding an aggregation node to a relationship graph to which a first entity is directed includes: adding an aggregation node in the relationship graph, and adding a relationship of a first entity pointing to the added aggregation node in the relationship graph; and taking the opposite end entity node of the first type of relation existing in the relation map and the entity node corresponding to the other entity in the relation to be added as the entity node associated with the added aggregation node, and taking the first type of relation existing in the relation map and the relation to be added as the relationship associated with the added aggregation node.
In an exemplary embodiment, updating an aggregation node to which a first entity is directed includes: acquiring an aggregation node pointed by the first entity; adding the relation to be added into the incidence relation of the aggregation node pointed by the first entity, and adding the opposite-end entity node associated with the relation to be added into the incidence node of the aggregation node pointed by the first entity. As shown in fig. 5a-5b, determining that a first entity a of two entities corresponding to a first type (parent-child relationship) and a relationship to be added (parent-child relationship) exists in a relationship graph; if the first entity A associates a plurality of parent-child relationships in the relationship graph, searching for an aggregation node (parent-child relationship aggregation node) corresponding to the type of the parent-child relationship to be added of the first entity node A, updating connected nodes and connected edges of the aggregation node, and adding the parent-child relationship to be added and the opposite-end entity B corresponding to the relationship into the relationship graph. As shown in fig. 6a-6B, it is determined that the first type (peer relationship) and two entities a and B corresponding to the relationship to be added (peer relationship) both exist in the relationship graph, and if a plurality of edges of the peer relationship exist in the relationship graph, the aggregation node-peer relationship aggregation node corresponding to the first type (peer relationship) relationship type of the first entity node a is found, and the connected nodes and the connected edges in the aggregation node are updated.
In an exemplary embodiment, for each relationship to be added to the relationship graph, the following operations are further performed respectively: when the first entity exists in the relationship graph and the other entity does not exist in the relationship graph in the two entities corresponding to the relationship to be added, adding an entity node corresponding to the other entity in the relationship graph, and adding the relationship between the first entity and the other entity in the relationship graph; adding a relationship between the first entity and the other entity in the relationship graph when both the first entity and the other entity exist in the relationship graph; when the first entity and the other entity do not exist in the relationship graph, adding entity nodes corresponding to the first entity and the other entity in the relationship graph, and adding the relationship between the first entity and the other entity in the relationship graph.
In step 102, after the addition of the relationship to be added is completed, an entity to be added to the relationship graph is determined, and a corresponding entity node is added to the relationship graph.
In this step, after all the relationships are added to the relationship graph, the entity to be added to the relationship graph is determined, and the corresponding entity node is added to the relationship graph.
In an exemplary embodiment, the determining the entity to be added to the relationship graph includes: acquiring the type of each node in the relation graph; when the node is an entity node, adding an entity corresponding to the entity node into an existing entity; when the node is an aggregation node, adding an entity corresponding to an opposite end entity node associated with the aggregation node into an existing entity; and removing the existing entity from the obtained entity to obtain the entity to be added into the relational graph.
In an exemplary embodiment, after determining an entity to be added to the relationship graph and adding a corresponding entity node to the relationship graph, the method further includes: when an aggregation node in the relationship graph is selected, if the aggregation node is in an aggregation state at present, acquiring a node associated with the aggregation node and an associated relationship, and displaying the node associated with the associated node and the associated relationship on the displayed relationship graph; and if the aggregation node is in the display state, hiding the nodes and the related relations of the aggregation node on the displayed relation graph. As shown in fig. 8, if the current node is in the aggregation state, connected nodes and connected edges on the aggregation node are obtained, and the nodes and edges stored in the connected nodes and connected edges are added to the relationship graph. As shown in fig. 9, if the current node is in the expanded state, the points and edges associated with the connected nodes and the connected edges on the aggregation node are hidden from the graph. As shown in fig. 10, B2 is a friend of a, B2 is a friend of B on the display relationship graph, when the display relationship graph is in an expanded state, 2 friend relationship aggregation nodes all point to B2, when the friend relationship of B is not displayed, edges of B and B2 are hidden and displayed, and a B2 node is kept on the relationship graph for display.
The present disclosure also provides an apparatus for updating a relationship map, as shown in fig. 2, including: a memory and a processor;
the memory is used for storing a program for updating the relation map;
the processor is used for reading the program for updating the relation map, and executing the following operations:
determining relationships between entities to be added to the relationship graph;
for each relation to be added to the relation map, the following operations are respectively carried out:
determining a first entity in the two entities corresponding to the first type and the relationship to be added; the first type is a relation type corresponding to the relation to be added;
when the first entity exists in the relationship graph, if the first entity is associated with a relationship of a first type in the relationship graph, adding an aggregation node in the relationship graph, and pointing the first entity to the aggregation node, wherein the aggregation node is a node containing a plurality of relationships of the same type; updating an aggregation node to which the first entity points if the first entity associates a plurality of relationships of a first type in the relationship graph;
determining an entity to be added into the relation graph, and adding a corresponding entity node into the relation graph.
In an exemplary embodiment, the determining relationships between entities to be added to the relationship graph includes:
acquiring existing nodes in a relational graph, and determining the type of each node, wherein the nodes comprise: an entity node and an aggregation node, wherein the entity node is a node corresponding to an entity;
when the node is an entity node, acquiring the relationship between the entities related to the entity node in the relationship graph, and adding the acquired relationship into the existing relationship between the entities in the relationship graph;
when the node is an aggregation node, acquiring a relationship which is associated with the aggregation node and points to an entity node from the aggregation node, and adding the relationship to the existing relationship between the entities of the relationship graph;
and removing the relationship between the existing entities of the relationship map from the relationship between the pre-acquired entities to obtain the relationship between the entities to be added into the relationship map.
In an exemplary embodiment, a first entity of the two entities corresponding to the relationship to be added refers to: and when only one entity node exists in the relationship graph of the two entities or when the two entities exist in the relationship graph, determining the entity corresponding to the entity node of the source node according to a preset principle.
In an exemplary embodiment, the adding an aggregation node to the relationship graph, and pointing the first entity to the aggregation node, includes:
adding an aggregation node in a relationship graph, and adding a relationship of the first entity pointing to the added aggregation node in the relationship graph; and taking the opposite end entity node of the first type of relationship existing in the relationship graph and the entity node corresponding to the other entity in the relationship to be added as the entity node associated with the added aggregation node, and taking the first type of relationship existing in the relationship graph and the relationship to be added as the relationship associated with the added aggregation node.
In an exemplary embodiment, for each relationship to be added to the relationship graph, the processor further performs the following operations:
when the first entity exists in the relationship graph and the other entity does not exist in the relationship graph in the two entities corresponding to the relationship to be added, adding an entity node corresponding to the other entity in the relationship graph, and adding the relationship between the first entity and the other entity in the relationship graph;
adding a relationship between the first entity and the other entity in the relationship graph when both the first entity and the other entity exist in the relationship graph;
when the first entity and the other entity do not exist in the relationship graph, adding entity nodes corresponding to the first entity and the other entity in the relationship graph, and adding the relationship between the first entity and the other entity in the relationship graph.
In an exemplary embodiment, the determining the entity to be added to the relationship graph includes:
acquiring the type of each node in the relation graph;
when the node is an entity node, adding an entity corresponding to the entity node into an existing entity;
when the node is an aggregation node, adding an entity corresponding to an opposite end entity node associated with the aggregation node into an existing entity;
and removing the existing entity from the obtained entity to obtain the entity to be added into the relational graph.
In an exemplary embodiment, the updating the aggregation node to which the first entity points includes:
acquiring an aggregation node pointed by the first entity;
adding the relation to be added into the incidence relation of the aggregation node pointed by the first entity,
and adding the opposite end entity node associated with the relation to be added into the associated node of the aggregation node pointed by the first entity.
In an exemplary embodiment, after determining an entity to be added to the relationship graph and adding a corresponding entity node to the relationship graph, the method further includes:
when an aggregation node in the relationship graph is selected, if the aggregation node is in an aggregation state at present, acquiring a node associated with the aggregation node and an associated relationship, and displaying the node associated with the associated node and the associated relationship on the displayed relationship graph; and if the aggregation node is in the display state, hiding the nodes and the related relations of the aggregation node on the displayed relation graph.
An exemplary embodiment includes the following steps 1-6:
step 1, acquiring all the entities and relations of the extension.
In this step, the interface service may be invoked to obtain all entities and relationships, where the relationships refer to relationships between the entities of the obtained entities.
And 2, traversing the relational graph to obtain all nodes and edges in the relational graph.
In this step, the relationship graph includes nodes and edges; wherein the edge element is a connection line between nodes. The node comprises two types of entity node and aggregation node; the entity node can be defined as an entity and represents an entity, and the aggregation node can be defined as a relationship node and represents an aggregation node generated after the same type of relationship is aggregated; for example: and the relationship type is a parent-child relationship, and a plurality of entity nodes with the relationship type of the parent-child relationship are aggregated to generate a parent-child relationship aggregation node. The edges in the relationship graph comprise three types of relationships among entities, edges of entity nodes pointing to aggregation nodes and edges of aggregation nodes pointing to entity nodes, the relationships among the entity nodes can be defined as relationships and represent the relationships among the entities, the edges of the entity nodes pointing to the aggregation nodes can be defined as nodeToRelations and represent the edges of the entities pointing to the aggregation nodes, and the edges of the aggregation nodes pointing to the entity nodes can be defined as relatioToNodes and represent the edges of the aggregation nodes pointing to the entities; the types of nodes and edges in the relationship graph shown in fig. 3.
And 3, defining a plurality of variables and storing the data into the corresponding variables.
In this step, a plurality of variables are defined, including: defining entity variables for storing the acquired entities; defining relation variables relationships for storing the obtained relationships between the entities; defining an existing entity variable currentEntities for storing an existing entity on a relational graph; defining existing relation variables currentRelations for storing the existing relations between the entities on the relation graph; defining an entity variable adddnodes to be added, and storing an entity node to be added to the relation graph; and defining a relation variable addEdedges to be added, and storing the relation between the entities to be added to the relation map.
And 4, determining the relationship between the entities to be added into the relationship map.
In this step, the implementation step of determining the relationship between entities to be added to the relationship graph includes:
step 41, obtaining existing nodes in the relational graph, and determining the type of each node, wherein the entity node is a node corresponding to an entity;
step 42, when the node is an entity node entity, acquiring the relationship between the entities related to the entity node in the relationship graph, and adding the acquired relationship to currentrelationships in the existing relationships between the entities in the relationship graph;
step 43, when the node is an aggregation node relationship node, acquiring a relationship which is associated with the aggregation node and points to an entity node from the aggregation node, and adding the relationship to the existing relationships currentrelationships between entities of the relationship graph;
and 44, removing the existing relationships currentrelationships among the entities of the relationship graph from the relationships among the entities acquired in the step 1 to obtain the relationships among the entities to be added into the relationship graph.
And 5, adding the relation set among the entities to be added into the current relation map according to a preset rule.
In this step, for each relationship to be added to the relationship graph, the following operations are performed, respectively:
step 51, determining two entities corresponding to the relationship to be added into the relationship graph, wherein the two entities corresponding to the relationship represent a first entity by A and a second entity by B or are called as another entity;
step 52, if the entity A and the entity B do not exist in the relation map, adding two entity nodes A and B and a relation R to be added into the relation map in the relation map;
step 53, if one of the entities a and B exists in the relationship graph, taking the case that the first entity a exists in the relationship graph and the other entity B does not exist in the relationship graph as an example (the first entity a does not exist in the relationship graph, and the other entity B exists in the relationship graph, the same implementation steps are also adopted), and determining whether the entity a has an edge of a relationship type between the entities, and adding a node B and a relationship to be added to the relationship graph in the relationship graph according to a determination result, wherein the implementation process includes:
step 531, if the entity a does not have an edge of a relationship type between entities, adding another entity B in the relationship map, and adding a relationship R between the first entity B and the another entity in the relationship map;
step 532, if the first entity a is associated with a first type of relationship R1 in the relationship graph, adding an aggregation node in the relationship graph to which the first entity is directed, including: adding an aggregation node in a relationship graph, and adding a relationship of the first entity pointing to the added aggregation node in the relationship graph; taking an opposite end entity node of the relationship of the first type existing in the relationship map and an entity node corresponding to another entity in the relationship to be added as entity nodes associated with the added aggregation node, and taking the relationship of the first type existing in the relationship map and the relationship to be added as the relationship associated with the added aggregation node; wherein, the aggregation node refers to a node containing a plurality of relationships of the same type. 4a-4b, entities A and A1 already exist in the relationship graph in FIG. 4a, the relationship between the entities A and A1 is represented by R1, and the relationship type of the relationship is a parent-child relationship; in fig. 4b, an aggregation node is added to the relationship graph, and the name of the aggregation node is a parent-child relationship; adding another entity and an edge of the parent-child relationship of the A pointing to the aggregation node in the relationship graph, and hiding and displaying the entity A1 in the relationship graph; the aggregation node comprises entity nodes connected and associated with the aggregation node and associated edges connected and edges in the aggregation node, a correspondent entity A1 and an entity B which are associated with R1 are saved in the connected nodes, and R1 are saved in the connected and edges. When the aggregation node in fig. 4c is expanded, the entity a connects the aggregation node (parent-child relationship) through an edge of the parent-child relationship pointing to the aggregation node by a, and the parent-child relationship node connects the entity nodes a1 and B through relationships R1 and R, respectively.
Step 533. if the first entity associates a plurality of relationships of the first type in the relationship graph, updating an aggregation node pointed to by the first entity, including: acquiring an aggregation node pointed by a first entity; adding the relation to be added into the incidence relation of the aggregation node pointed by the first entity, and adding the opposite-end entity node associated with the relation to be added into the incidence node of the aggregation node pointed by the first entity. As shown in fig. 5a-5b, in fig. 5a, an entity a associates two edges R and R1 of parent-child relationship types in a relationship graph, an edge R2 of a parent-child relationship type is to be added, the entities corresponding to the relationship to be added are a and a2, and the implementation process of adding the edge R2 is as follows: acquiring an aggregation node (parent-child relationship aggregation node) pointed by the entity A, adding a parent-child relationship to be added into a connectednode in the association relationship of the parent-child relationship aggregation node, adding the entity A2 into an entity node connectednode associated with the aggregation node, storing A1, A2 and a body B in the connectednode, and storing R, R1 and R2 in the connectednode, as shown in 5B.
And step 54, if the entity A and the entity B exist in the relational graph, respectively inquiring the edges associated with the entity A and the entity B, and adding nodes and edges R in the current graph according to different conditions of the inquiry result.
In step 54, the implementation step of adding nodes and edges R in the current graph according to different situations of the query result includes:
step 541, if the entity A and the entity B do not have the associated edge, adding an edge R of a relationship type between the entities of the entity A and the entity B in the relationship map;
step 542, if the entity A and the entity B both have a plurality of associated edges, determining the entity A or the entity B as a source node according to a predetermined principle;
in this step, selecting the entity a or B as the source node according to the associated number of edges includes: when the number of edges associated with the entity A is more than that of the entity B, the entity A is selected as a source node; when the number of edges associated with the entity B is more than that of the entity A, selecting the entity B as a source node; and when the number of edges associated with the entity A is equal to the number of edges associated with the entity B, randomly selecting the entity A or the entity B as a source node. In the following steps, the physical node a is taken as an example of a source node.
Step 543, when the source node a has an edge with the same type as the current relationship to be added, adding an aggregation node in the relationship graph, and pointing the source node a to the aggregation node, including: adding an aggregation node in a relation graph, and adding a relation of the source node A pointing to the added aggregation node in the relation graph; and taking the opposite end entity node of the first type of relationship existing in the relationship map and the entity node corresponding to the other entity B in the relationship to be added as the entity node associated with the added aggregation node, and taking the first type of relationship existing in the relationship map and the relationship to be added as the relationship associated with the added aggregation node. As shown in fig. 6a-6B, the entity nodes a and B in fig. 6a exist in the relationship graph, and are to be added to the relationship R of the entity nodes a and B in the relationship graph; the entity node a is a source node, the entity node a has an edge R1 (edge of the same-row relationship from the entity a to the entity a 1) having the same relationship type as the relationship R to be added, the opposite end entity node corresponding to the existing edge R1 is a1, an aggregation node (aggregation node of the same-row relationship) is added in the relationship graph, the node type is relationship node, entity nodes B and a1 are stored in connected nodes of the aggregation node, connected edges store two edges R1 and R having the same relationship type and the same-row relationship, and the entity a is added in the graph and points to the edge of the aggregation node, the edge type is node relationship, as shown in fig. 6B.
And 544, when a plurality of edges which have the same type as the first relation to be added currently exist in the source node A, updating the aggregation node pointed by the source node A.
In this step, updating the aggregation node pointed to by the source node a includes: acquiring an aggregation node pointed by a source node A; adding the relation to be added into the incidence relation of the aggregation node pointed by the source node A, and adding the opposite end entity node associated with the relation to be added into the incidence node of the aggregation node pointed by the source node A. As shown in fig. 7a-7B, in fig. 7a, two edges of the same relationship type (peer relationship) as the relationship to be added exist in the source node a, and the peer relationship between a and B2 is to be added; determining the aggregation node corresponding to the relationship type of the peer relationship in the source node a, updating connected nodes and connected edges in the aggregation node, adding an entity node B2 in the connected nodes, and adding an edge of the peer relationship, which points to B2, in the connected edges, as shown in fig. 7B.
And 6, determining an entity to be added into the relation graph, and adding a corresponding entity node into the relation graph.
In this step, after all the relationships to be added in step 54 are executed, for the relationship graph obtained after the relationships are added, the entities to be added to the relationship graph are determined, and the corresponding entity nodes are added to the relationship graph, which is implemented as follows:
step 61, acquiring the type of each node in the relation graph;
step 62, when the node is an entity node, adding the entity corresponding to the entity node into the existing entity;
step 63, when the node is an aggregation node, adding an entity corresponding to an opposite end entity node associated with the aggregation node into an existing entity;
and step 64, removing the existing entity from the obtained entity to obtain the entity to be added into the relational graph.
And 65, adding corresponding entity nodes in the relation graph.
Step 7, when the aggregation node in the relation map is selected, if the aggregation node is in an aggregation state at present, acquiring the node associated with the aggregation node and the associated relation, and displaying the node associated with the associated node and the associated relation on the displayed relation map; as shown in fig. 8, the current node is in an aggregation state, the connectedNodes and connectedEdges of the current aggregation node are obtained, and the entity nodes and edges stored in the connectedNodes and connectedEdges are added to the display relationship graph.
In addition, if the entity node associated with the current aggregation node has an association relationship with other nodes, the associated entity node is retained on the relationship graph, and the associated edge is hidden from the display relationship graph. As shown in fig. 10, B2 is a friend of a, B2 is also a friend of B on the display relationship graph, when the display relationship graph is in an expanded state, 2 friend relationship aggregation nodes all point to B2, when the friend relationship of B is not displayed, edges of B and B2 are hidden and displayed, and a B2 node remains on the relationship graph for display.
The invention provides a method for updating a relation graph, which reduces nodes and relations shown in the relation graph and improves readability by a method for aggregating the same relations.
In an exemplary embodiment, interaction can be added to the aggregation node, the aggregated entities and relationships can be displayed or hidden by a user through clicking, and the use experience of the user is improved.
It will be understood by those of ordinary skill in the art that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation. Some or all of the components may be implemented as software executed by a processor, such as a digital signal processor or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as is well known to those of ordinary skill in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by a computer. In addition, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media as known to those skilled in the art.
Claims (10)
1. A method for updating a relationship graph, the method comprising:
determining relationships between entities to be added to the relationship graph;
for each relation to be added to the relation map, the following operations are respectively carried out:
determining a first entity in the two entities corresponding to the first type and the relationship to be added; the first type is a relation type corresponding to the relation to be added;
when the first entity exists in the relationship graph, if the first entity is associated with a relationship of a first type in the relationship graph, adding an aggregation node in the relationship graph, and pointing the first entity to the aggregation node, wherein the aggregation node is a node containing a plurality of relationships of the same type; updating an aggregation node to which the first entity points if the first entity associates a plurality of relationships of a first type in the relationship graph;
and after the addition of the relation to be added is finished, determining the entity to be added into the relation map, and adding a corresponding entity node into the relation map.
2. The method for updating the relationship graph according to claim 1, wherein the determining the relationship between the entities to be added to the relationship graph comprises:
acquiring existing nodes in a relational graph, and determining the type of each node, wherein the nodes comprise: an entity node and an aggregation node, wherein the entity node is a node corresponding to an entity;
when the node is an entity node, acquiring the relationship between the entities related to the entity node in the relationship graph, and adding the acquired relationship into the existing relationship between the entities in the relationship graph;
when the node is an aggregation node, acquiring a relationship which is associated with the aggregation node and points to an entity node from the aggregation node, and adding the relationship to the existing relationship between the entities of the relationship graph;
and removing the relationship between the existing entities of the relationship map from the relationship between the pre-acquired entities to obtain the relationship between the entities to be added into the relationship map.
3. The method for updating the relationship graph according to claim 1, wherein a first entity of the two entities corresponding to the relationship to be added is: and when only one entity node exists in the relationship graph of the two entities or when the two entities exist in the relationship graph, determining the entity corresponding to the entity node of the source node according to a preset principle.
4. The method for updating the relationship graph according to claim 1, wherein adding an aggregation node to which the first entity is directed in the relationship graph comprises:
adding an aggregation node in a relationship graph, and adding a relationship of the first entity pointing to the added aggregation node in the relationship graph; and taking the opposite end entity node of the first type of relationship existing in the relationship graph and the entity node corresponding to the other entity in the relationship to be added as the entity node associated with the added aggregation node, and taking the first type of relationship existing in the relationship graph and the relationship to be added as the relationship associated with the added aggregation node.
5. The method for updating the relationship map according to claim 4, wherein for each relationship to be added to the relationship map, the following operations are further performed respectively:
when the first entity exists in the relationship graph and the other entity does not exist in the relationship graph in the two entities corresponding to the relationship to be added, adding an entity node corresponding to the other entity in the relationship graph, and adding the relationship between the first entity and the other entity in the relationship graph;
adding a relationship between the first entity and the other entity in the relationship graph when both the first entity and the other entity exist in the relationship graph;
when the first entity and the other entity do not exist in the relationship graph, adding entity nodes corresponding to the first entity and the other entity in the relationship graph, and adding the relationship between the first entity and the other entity in the relationship graph.
6. The method for updating the relationship graph according to claim 5, wherein the determining the entity to be added to the relationship graph comprises:
acquiring the type of each node in the relation graph;
when the node is an entity node, adding an entity corresponding to the entity node into an existing entity;
when the node is an aggregation node, adding an entity corresponding to an opposite end entity node associated with the aggregation node into an existing entity;
and removing the existing entity from the obtained entity to obtain the entity to be added into the relational graph.
7. The method for updating the relationship graph according to claim 6, wherein the updating the aggregation node to which the first entity points comprises:
acquiring an aggregation node pointed by the first entity;
adding the relation to be added into the incidence relation of the aggregation node pointed by the first entity,
and adding the opposite end entity node associated with the relation to be added into the associated node of the aggregation node pointed by the first entity.
8. The method for updating the relationship graph according to claim 7, wherein after determining the entities to be added to the relationship graph and adding the corresponding entity nodes in the relationship graph, the method further comprises:
when an aggregation node in the relationship graph is selected, if the aggregation node is in an aggregation state at present, acquiring a node associated with the aggregation node and an associated relationship, and displaying the node associated with the associated node and the associated relationship on the displayed relationship graph; and if the aggregation node is in the display state, hiding the nodes and the related relations of the aggregation node on the displayed relation graph.
9. An apparatus for updating a relationship graph, comprising: a memory and a processor; the method is characterized in that:
the memory is used for storing a program for updating the relation map;
the processor, which is configured to read the program for performing the update of the relationship graph, performs the method of any one of claims 1 to 8.
10. A computer-readable storage medium storing computer-executable instructions that, when executed by a processor, perform operations in a method as recited in any of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010434617.XA CN111737369B (en) | 2020-05-21 | 2020-05-21 | Method, device and storage medium for updating relationship map |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010434617.XA CN111737369B (en) | 2020-05-21 | 2020-05-21 | Method, device and storage medium for updating relationship map |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111737369A true CN111737369A (en) | 2020-10-02 |
| CN111737369B CN111737369B (en) | 2024-07-23 |
Family
ID=72647555
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010434617.XA Active CN111737369B (en) | 2020-05-21 | 2020-05-21 | Method, device and storage medium for updating relationship map |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111737369B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112000718A (en) * | 2020-10-28 | 2020-11-27 | 成都数联铭品科技有限公司 | Attribute layout-based knowledge graph display method, system, medium and equipment |
| WO2023004632A1 (en) * | 2021-07-28 | 2023-02-02 | 京东方科技集团股份有限公司 | Method and apparatus for updating knowledge graph, electronic device, storage medium, and program |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109508381A (en) * | 2018-09-29 | 2019-03-22 | 北京国双科技有限公司 | The processing method and processing device of knowledge mapping |
| CN109885691A (en) * | 2019-01-08 | 2019-06-14 | 平安科技（深圳）有限公司 | Knowledge mapping complementing method, device, computer equipment and storage medium |
| CN110659395A (en) * | 2019-08-14 | 2020-01-07 | 平安科技（深圳）有限公司 | Relational network map construction method and device, computer equipment and storage medium |
| WO2020007224A1 (en) * | 2018-07-06 | 2020-01-09 | 中兴通讯股份有限公司 | Knowledge graph construction and smart response method and apparatus, device, and storage medium |
-
2020
- 2020-05-21 CN CN202010434617.XA patent/CN111737369B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020007224A1 (en) * | 2018-07-06 | 2020-01-09 | 中兴通讯股份有限公司 | Knowledge graph construction and smart response method and apparatus, device, and storage medium |
| CN109508381A (en) * | 2018-09-29 | 2019-03-22 | 北京国双科技有限公司 | The processing method and processing device of knowledge mapping |
| CN109885691A (en) * | 2019-01-08 | 2019-06-14 | 平安科技（深圳）有限公司 | Knowledge mapping complementing method, device, computer equipment and storage medium |
| CN110659395A (en) * | 2019-08-14 | 2020-01-07 | 平安科技（深圳）有限公司 | Relational network map construction method and device, computer equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 夏维;王珊蕾;尹子都;岳昆;: "基于互信息的知识图谱实体关联关系建模与补全", 计算机科学与探索, no. 07, pages 49 - 59 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112000718A (en) * | 2020-10-28 | 2020-11-27 | 成都数联铭品科技有限公司 | Attribute layout-based knowledge graph display method, system, medium and equipment |
| CN112000718B (en) * | 2020-10-28 | 2021-05-18 | 成都数联铭品科技有限公司 | Attribute layout-based knowledge graph display method, system, medium and equipment |
| WO2023004632A1 (en) * | 2021-07-28 | 2023-02-02 | 京东方科技集团股份有限公司 | Method and apparatus for updating knowledge graph, electronic device, storage medium, and program |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111737369B (en) | 2024-07-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111737369B (en) | Method, device and storage medium for updating relationship map | |
| CN116521956A (en) | Graph database query method and device, electronic equipment and storage medium | |
| CN112860953A (en) | Data importing method, device, equipment and storage medium of graph database | |
| CN112948503A (en) | Target characteristic tree structure graph rendering method and device | |
| CN113190325A (en) | Container creation method and device | |
| CN111752941B (en) | Data storage and access method and device, server and storage medium | |
| CN110059088B (en) | Data attribute identification method, device and equipment in block chain type account book | |
| CN111142990A (en) | WeChat applet page display method and device and storage medium | |
| CN105868401A (en) | Image management method for terminal equipment and terminal device | |
| CN111753141A (en) | Data management method and related equipment | |
| CN114170364A (en) | Rendering process determination method and device and electronic equipment | |
| CN110932884B (en) | Method and device for adding multiple networks to cloud physical machine | |
| CN113435948A (en) | E-commerce platform data monitoring method and system | |
| CN109299765B (en) | Anti-collision method and device for radio frequency identification equipment of multiple internet of things and storage medium | |
| CN111858487A (en) | Data updating method and device | |
| CN108073712B (en) | Method and device for deleting main data in information system and computer equipment | |
| CN111274410A (en) | Data storage method and device and data query method and device | |
| CN110944047A (en) | Distributed application monitoring method and device | |
| CN112148725B (en) | Method and device for realizing global unique index | |
| CN113723991B (en) | Marketing article influence analysis processing method and device | |
| CN110381121B (en) | Data processing method and device | |
| CN111813471B (en) | Skin changing method, terminal and storage medium | |
| CN114154944B (en) | Business auditing method, equipment and computer readable storage medium | |
| CN109460385B (en) | Data access method for trace of electronic government system | |
| CN109375988B (en) | Distributed lock implementation method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |