Patent ID: 9411857
Filing Date: 2016-08-09
CPC Classification: G06F

Claim Text:
1. A computer-implemented method comprising: receiving a search request that includes query text that identifies a first entity; identifying in an entity graph a first entity node that represents the first entity, wherein entity nodes in the entity graph each represent respective entities, wherein each link in the entity graph connects a corresponding pair of entity nodes and has a respective relationship type, each relationship type representing a corresponding relationship between the entities represented by the entity nodes connected by the link; identifying a plurality of groups of related entity nodes for the first entity node, wherein for each group, the nodes in the group are each connected to the first entity node by a respective path having a same path type specific to the group, each path between the first entity node and each node in the group having multiple sequential links in the entity graph, wherein the path type for each respective path between the first entity node and each node in the group is defined by a same ordered sequence of relationship types of the multiple sequential links in the entity graph between the first entity node and the node along the path; determining that a first group of related entity nodes is a highest-ranked group of related entity nodes in a ranking of the plurality of groups of related entity nodes; obtaining information describing one or more related entities represented by one or more entity nodes in the first group of related entity nodes; generating a presentation that includes the information describing the one or more related entities represented by the one or more entity nodes in the first group of related entity nodes; and providing the presentation in response to the search request.