# US 2024/0004931 A1 · Unified graph generation

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0004931 A1
- Document ID: US20240004931A1
- Status: Published application
- Kind: A1
- Application number: 17/854,336
- Filed: 2022-06-30
- Published: 2024-01-04
- Earliest claimed: 2022-06-30
- Assignees: Microsoft Technology Licensing, LLC
- Applicants: Microsoft Technology Licensing, LLC
- Inventors: Vipindeep VANGALA; Long QIU; Rafael Ferreira BARCELOS; Julien J.T. PIERRE; Sangita N. PITRE; Nishchay KUMAR; Giselli PANONTINI DE SOUZA; Juan Diego FERRE
- Web page: https://patentgrep.com/patent/US20240004931A1

## CPC

- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06Q 10/107: Computer-aided management of electronic mailing [e-mailing]
- G06F 16/9038: Presentation of query results
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

A method of generating a unified graph is described. First graph data is received from a first data source, nodes within the first graph data including first, second, and third fields. Second graph data is received from a second data source, nodes within the second graph data including first, second, and fourth fields. The unified graph is generated from the first and second graph data using aggregated fields of the first field and the third field as a unique identifier of a unified schema for nodes within the unified graph having a first type and aggregated fields of the first field and the fourth field as a unique identifier of the unified schema for nodes within the unified graph having a second type, wherein nodes of the unified graph represent entities and edges of the unified graph represent relationships among the entities.

## Claims

### Claim 1

A computer-implemented method of generating a unified graph, the method comprising:
receiving first graph data from a first data source, nodes within the first graph data including at least a first field, a second field, and one or more third fields;
receiving second graph data from a second data source, nodes within the second graph data including at least the first field, the second field, and one or more fourth fields; and
generating the unified graph from the first graph data and the second graph data using aggregated fields of the first field and the third field as a unique identifier of a unified schema for nodes within the unified graph having a first type and aggregated fields of the first field and the fourth field as a unique identifier of the unified schema for nodes within the unified graph having a second type, wherein nodes of the unified graph represent entities and edges of the unified graph represent relationships among the entities.

### Claim 2 (depends on 1)

The method of claim 1, wherein:
the first graph data represents a first sub-graph of nodes and edges according to a first schema and the second graph data represents a second sub-graph of nodes and edges according to a second schema; and
generating the unified graph comprises: combining the first sub-graph and the second sub-graph to form the unified graph.

### Claim 3 (depends on 2)

The method of claim 2, wherein:
a first source node within the first graph data represents a first entity and a second source node within the second graph data represents the first entity; and
generating the unified graph comprises de-duplicating the first source node and the second source node within the unified graph, including generating a unified node having the first field, the second field, the one or more third fields, and the one or more fourth fields.

### Claim 4 (depends on 3)

The method of claim 3, wherein generating the unified graph comprises aggregating the first field and the second field, including normalizing values of the first field of the first graph data and the second field of the second graph data.

### Claim 5 (depends on 4)

The method of claim 4, wherein normalizing the values comprises converting at least one of the first field of the first graph data and the first field of the second graph data into a unified field format.

### Claim 6 (depends on 2)

The method of claim 2, wherein:
the first data source corresponds to a first user application;
the second data source corresponds to a second user application; and
the first and second data sources generate the first and second graph data independently from each other.

### Claim 7 (depends on 1)

The method of claim 1, wherein the unified graph is a heterogenous graph having nodes with different types.

### Claim 8 (depends on 7)

The method of claim 7, wherein the unified schema has core fields that are populated for each node of the unified graph and type-based fields that are populated only for nodes of the unified graph having a particular type.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
generating a new edge of the unified graph between a first unified node and a second unified node, wherein the new edge represents a relationship that is not found in the first graph data or the second graph data; and
pushing a graph data update to at least one of the first data source and the second data source with the new edge.

### Claim 10 (depends on 1)

The method of claim 1, wherein:
the entities include users, documents, emails, meetings, and conversations; and
the relationships include document authorship, document modification, document sharing, meeting invites, linked data between documents, email sending, and email replying.

### Claim 11 (depends on 1)

The method of claim 1, further comprising:
receiving a request for graph data based on the unified graph, the request for graph data including a request for nodes of the unified graph that are related to a search query; and
generating a view of the unified graph in response to the search query, wherein the view includes a subset of nodes of the unified graph.

### Claim 12 (depends on 1)

The method of claim 1, further comprising:
receiving a request for graph data based on the unified graph; and
wherein the request for graph data is a request for edges between selected nodes of the unified graph and the graph data corresponds to predicted relationships between the selected nodes.

### Claim 13

A system for generating a unified graph, the system comprising:
a first data source that stores first graph data;
a second data source that stores second graph data;
a node processor configured to receive requests for the unified graph data, obtain the first graph data from the first data source and the second graph data from the second data source, and generate a unified graph based on the first graph data and the second graph data using aggregated fields of the first field and the third field as a unique identifier of a unified schema for nodes within the unified graph having a first type and aggregated fields of the first field and the fourth field as a unique identifier of the unified schema for nodes within the unified graph having a second type; and
a unified data store configured to store the unified graph;
wherein nodes of the unified graph represent entities and edges of the unified graph represent relationships among the entities.

### Claim 14 (depends on 13)

The system of claim 13, wherein the first data source stores data for a first user application according to a first schema and the second data source stores data for a second user application according to a second schema.

### Claim 15 (depends on 14)

The system of claim 14, wherein the first data source and the second data source generate the first and second graph data independently from each other.

### Claim 16 (depends on 13)

The system of claim 13, wherein the node processor is configured to generating the unified graph by de-duplicating related nodes within the unified graph that represent a same entity.

### Claim 17

A system for generating a unified graph, the system comprising:
at least one processor, and
at least one memory storing computer-executable instructions that when executed by the at least one processor cause the at least one processor to:
receive first graph data from a first data source, nodes within the first graph data including at least a first field, a second field, and one or more third fields;
receive second graph data from a second data source, nodes within the second graph data including at least the first field, the second field, and one or more fourth fields; and
generate the unified graph from the first graph data and the second graph data using aggregated fields of the first field and the third field as a unique identifier of a unified schema for nodes within the unified graph having a first type and aggregated fields of the first field and the fourth field as a unique identifier of the unified schema for nodes within the unified graph having a second type, wherein nodes of the unified graph represent entities and edges of the unified graph represent relationships among the entities.

### Claim 18 (depends on 17)

The system of claim 17, wherein:
the first graph data represents a first sub-graph of nodes and edges according to a first schema;
the second graph data represents a second sub-graph of nodes and edges according to a second schema; and
the computer-executable instructions cause the at least one processor to combine the first sub-graph and the second sub-graph to form the unified graph.

### Claim 19 (depends on 18)

The system of claim 18, wherein:
a first source node within the first graph data represents a first entity and a second source node within the second graph data represents the first entity; and
the computer-executable instructions cause the at least one processor to de-duplicate the first source node and the second source node within the unified graph, including generating a unified node having the first field, the second field, the one or more third fields, and the one or more fourth fields.

### Claim 20 (depends on 19)

The system of claim 19, wherein the computer-executable instructions cause the at least one processor to aggregate the first field and the second field, including normalizing values of the first field of the first graph data and the first field of the second graph data.
