Spoke Software

Christopher S Tolles

James Kelly

Timothy J Connors

Prasad N Akella

Andrew Michael Rosenbaum

Christopher J Roon

Ben T Smith, Iv

A relationship graph representing a social network connecting multiple entities is created and maintained as nodes and edges. Data received for an entity is used to create a new node. A strength of relationship value is calculated for each relationship between the new entity and an entity represented by an existing node and assigned to an edge is created to represent each relationship. Data received for an existing node causes the node to be updated, and the strength of relationship values for each of its relationships to be recalculated and assigned to the appropriate edge. More than one node may exist for an entity and conflicts among the data of the multiple nodes are reconciled. The received data may be extracted from data sources owned by a user in accordance with privacy criteria for the user, or may result from processing data in the relationship graph.

Creation and maintenance of social relationship network graphs

A relationship graph of nodes representing entities and edges representing relationships among the entities is searched to find a match on search criteria, such as an individual or a company. Paths through the relationship graph to the match are identified and a relevance value is associated with each path. A node in each path is specified as a connector for the path. The connectors and relevance values may be displayed to allow a choice of paths. If more than one match is found, a selection may be made by a user. Additionally, any matches may be filtered according to privacy rules.

Selecting an optimal path through a relationship graph

Growing community of inventors

San Francisco, CA, United States of America

Christopher S Tolles