Managing a distributed knowledge graph

A system for managing a knowledge graph, the knowledge graph comprising vertices and edges, the system comprising:

• one or more processors;
• and
• a memory communicatively coupled to the one or more processors,
• wherein the memory comprises instructions which, when executed by the one or more processors, cause the one or more processors to perform a method comprising:
• dividing the knowledge graph into a plurality of sub-graphs, each sub-graph comprising a plurality of vertices and a plurality of edges;
• representing the knowledge graph as a summary graph comprising for each of the sub-graphs a summary-graph vertex, wherein each summary graph vertex is related to a respective index file and a respective content file, wherein the respective index file comprises a list of the vertices of the sub-graph and edges of the sub-graph, and wherein the respective content file comprises searchable content of the sub-graph;
• generating a local sub-graph as a copy of one of the sub-graphs together with a copy of a surrounding graph to the one of the sub-graphs, wherein the surrounding graph comprises a group of vertices of the knowledge graph that are each linked to the plurality of vertices of the one of the sub-graphs via less than a threshold number of edges;
• modifying the content of the local sub-graph;
• and
• reintegrating, upon a reintegration trigger event, the local sub-graph back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph.

A computer program product for managing a knowledge graph, the knowledge graph comprising vertices and edges, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the program instructions executable by a computer to perform a method comprising:

• dividing the knowledge graph into a plurality of sub-graphs, each sub-graph comprising a plurality of vertices and a plurality of edges;
• representing the knowledge graph as a summary graph comprising for each of the sub-graphs a summary-graph vertex, wherein each summary graph vertex is related to a respective index file and a respective content file, wherein the respective index file comprises a list of the vertices of the sub-graph and edges of the sub-graph, and wherein the respective content file comprises searchable content of the sub-graph;
• generating a local sub-graph as a copy of one of the sub-graphs together with a copy of a surrounding graph to the one of the sub-graphs, wherein the surrounding graph comprises a group of vertices of the knowledge graph that are each linked to the plurality of vertices of the one of the sub-graphs via less than a threshold number of edges;
• modifying the content of the local sub-graph;
• and
• reintegrating, upon a reintegration trigger event, the local sub-graph back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph.