Method, device and storage medium for deduplicating entity nodes in graph database

An electronic device for deduplicating entity nodes in a graph database, wherein the graph database comprises at least one knowledge graph, the graph database is a distributed graph database based on a design of separate architecture for storage and computation, the graph database comprises a plurality of computing nodes and storage nodes, each storage node saves a different part of the knowledge graph and the knowledge graph is obtained by splicing the different part of the knowledge graph stored in each storage node, the electronic device is the computing node in the plurality of computing nodes and comprises:

• at least one processor;
• and
• a memory communicatively coupled to the at least one processor;
• wherein,
• the memory is configured to store instructions executable by the at least one processor, and when the instructions are executed by the at least one processor, the at least one processor is enabled to implement:
• obtaining a set of entity nodes to be deduplicated from a knowledge graph, wherein the set comprises a plurality of entity nodes, wherein the computing node performs multi-step graph walk on the graph database, and an entity node result is obtained for a current step from the knowledge graph is determined as the set of entity nodes to be deduplicated;
• selecting an untraversed entity node from the set as a target entity node;
• determining a range located by a node identifier corresponding to the target entity node, wherein the traversed entity nodes comprise entity nodes after deduplication in previous steps;
• determining the target entity node that has appeared in traversed entity nodes according to a deduplicating mode corresponding to the range;
• deleting the target entity node from the set;
• obtaining a plurality of first bit segments corresponding to the node identifier of the target entity node by performing segmenting on bits of the node identifier of the target entity node, wherein bit lengths of the first bit segments are the same, and some of the first bit segments contain the same bits;
• for each first bit segment, obtaining a first bitset corresponding to the first bit segment, wherein a bit length of the first bitset is greater than or equal to the bit length of the first bit segment;
• obtaining bits corresponding to a value of the first bit segment from the first bitset;
• and
• determining values of bits corresponding to the first bit segments as first values, wherein the first value is configured to indicate that the value corresponding to the first bit segment has appeared.

A non-transitory computer-readable storage medium having computer instructions stored thereon, wherein the computer instructions are configured to cause a computer to implement a method for deduplicating entity nodes in a graph database, wherein the graph database comprises at least one knowledge graph, the graph database is a distributed graph database based on a design of separate architecture for storage and computation, the graph database comprises a plurality of computing nodes and storage nodes, each storage node saves a different part of the knowledge graph and the knowledge graph is obtained by splicing the different part of the knowledge graph stored in each storage node, and the computer is the computing node in the plurality of computing nodes and the method comprises:

• obtaining a set of entity nodes to be deduplicated from the knowledge graph, wherein the set comprises a plurality of entity nodes, wherein the computing node performs multi-step graph walk on the graph database, and an entity node result is obtained for a current step from the knowledge graph is determined as the set of entity nodes to be deduplicated;
• selecting an untraversed entity node from the set as a target entity node;
• determining a range located by a node identifier corresponding to the target entity node, wherein the traversed entity nodes comprise entity nodes after deduplication in previous steps;
• determining the target entity node that has appeared in traversed entity nodes according to a deduplicating mode corresponding to the range;
• deleting the target entity node from the set;
• obtaining a plurality of first bit segments corresponding to the node identifier of the target entity node by performing segmenting on bits of the node identifier of the target entity node, wherein bit lengths of the first bit segments are the same, and some of the first bit segments contain the same bits;
• for each first bit segment, obtaining a first bitset corresponding to the first bit segment, wherein a bit length of the first bitset is greater than or equal to the bit length of the first bit segment;
• obtaining bits corresponding to a value of the first bit segment from the first bitset;
• and
• determining values of bits corresponding to the first bit segments as first values, wherein the first value is configured to indicate that the value corresponding to the first bit segment has appeared.