Connection Sub-graphs In Entity Relationship Graphs


Techniques are described herein for a connection sub-graph generator that identifies important relationships between entities in entity relationship graphs. The generator first identifies two entities in an entity relationship graphs. A plurality of candidate path relationships between the two entities may be determined. For each such candidate path relationship, the generator determines a path type based on types of edge relationships that make up the candidate path relationship and generates a score value for the candidate path. This score value is based in part on the path type of the candidate path relationship. One or more candidate path relationships that have score values that indicate a high likelihood of interest to a user is selected to be included in a connection sub-graph.

Download PDF
Document Preview
Document History
  • Publication: Jan 29, 2009
  • Application: Jul 23, 2007
    US US 78168507 A
  • Priority: Jun 6, 2007
    IN IN 1217DE2007 A

Sign in to the Lens