Disambiguation of massive graph databases

A system for disambiguating graph data, comprising:

• a memory storing computer-executable instructions;
• a processor configured to execute the computer-executable instructions and to cause the system to:
• receive entity data from a data source in a first format, wherein the entity data comprises a set of nodes;
• determine, based on a blocking parameter, a blocked data set comprising a subset of nodes from the set of nodes, wherein each node in the subset of nodes matches the blocking parameter;
• match at least two nodes in the blocked data set based on the at least two nodes representing a matched entity;
• create a new node associated with the matched entity by merging the matched at least two nodes into the new node;
• generate a unique ID for the new node;
• and
• update a graph database with the new node, including:
• creating one more edges between the new node and one or more other nodes having edges to the matched at least two nodes;
• and
• removing the matched at least two nodes and all edges associated with the matched at least two nodes.

A non-transitory computer-readable medium comprising computer-executable instructions that, when executed by a processor of a processing system, cause the processing system to perform a method for disambiguating graph data, the method comprising:

• receiving entity data from a data source, wherein the entity data comprises a set of nodes;
• determining, based on a blocking parameter, a blocked data set comprising a subset of nodes from the set of nodes, wherein each node in the subset of nodes matches the blocking parameter;
• matching at least two nodes in the blocked data set based on the at least two nodes representing a matched entity;
• creating a new node associated with the matched entity by merging the matched at least two nodes into the new node representing the same matched entity;
• generating a unique ID for the new node;
• updating a graph database with the new node, including:
• creating one more edges between the new node and one or more other nodes having edges to the matched at least two nodes;
• and
• removing the matched at least two nodes and all edges associated with the matched at least two nodes.