US 12,141,204 B2
Unified graph generation
Vipindeep Vangala, Hyderabad (IN); Long Qiu, Kirkland, WA (US); Rafael Ferreira Barcelos, Kirkland, WA (US); Julien J. T. Pierre, Sammamish, WA (US); Sangita N. Pitre, Hyderabad (IN); Nishchay Kumar, Delhi (IN); Giselli Panontini De Souza, Seattle, WA (US); and Juan Diego Ferre, Seattle, WA (US)
Assigned to Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed by Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed on Jun. 30, 2022, as Appl. No. 17/854,336.
Prior Publication US 2024/0004931 A1, Jan. 4, 2024
Int. Cl. G06F 16/00 (2019.01); G06F 16/901 (2019.01); G06F 16/9038 (2019.01)
CPC G06F 16/9024 (2019.01) [G06F 16/9038 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A computer-implemented method of generating a unified graph, the method comprising:
receiving first graph data for a first data graph from a first data source, wherein the first data graph includes first source nodes associated with at least a first field, a second field, and one or more third fields;
receiving second graph data for a second data graph from a second data source, wherein the second data graph includes second source nodes associated with at least the first field, the second field, and one or more fourth fields; and
generating a first unique identifier of a unified schema by aggregating the first field and a third field of the unified schema, wherein the first unique identifier is used for identifying nodes within the unified graph having a first type;
generating a second unique identifier of the unified schema by aggregating the first field and a fourth field of the unified schema, wherein the second unique identifier is used for identifying nodes within the unified graph having a second type;
generating the unified graph from the first graph data and the second graph data using the first unique identifier and the second unique identifier, wherein each node of the unified graph represents an entity and each edge between two nodes of the unified graph represents relationships among entities associated with the two nodes.