Microsoft Technology Licensing, LLC

Rafael Barcelos

Rajesh Ramanathan

Tali Roth

Ryan Edward Gregg

Justin B Mahood

Giselli Panontini DeSouza Sana

Linda Chen

Vipindeep Vangala

Nishchay Kumar

Juan Diego Ferre

Long Qiu

Sangita N Pitre

Giselli Panontini De Souza

Julien J T Pierre

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.

Unified graph generation

A message related to a first thread is received, and a fork in the conversation is identified. The received message is placed in a second thread and a display shows the fork and that the two threads are related.

Identifying relationships between message threads

When a message is received, the recipient set in the message, as well as ancestor message identifiers, are analyzed. The received message is either placed in an existing thread in an existing conversation, or in a new thread in the conversation, based upon the analysis of the recipient set and the ancestor identifiers.

Deriving atomic communication threads from independently addressable messages

Growing community of inventors

Bellevue, WA, United States of America

Rafael Barcelos