×

Fast component enumeration in graphs with implicit edges

  • US 9,916,393 B2
  • Filed: 06/02/2015
  • Issued: 03/13/2018
  • Est. Priority Date: 01/20/2009
  • Status: Active Grant
First Claim
Patent Images

1. A method for enumerating a graph, the method comprising:

  • creating, by a processor, a graph for a set of data records, each data record represented as a vertex in the graph, each data record comprising a unique index and one or more data elements;

    creating a key for each unique value of each data element represented by the vertices in the graph, each key representing an implicit edge in the graph;

    creating a plurality of lists of vertices, each list comprising a plurality of vertices in the graph, the vertices in a list sharing a same key; and

    deleting a list of vertices that share a key that expired under a predetermined condition.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×