Method and system for analyzing data

A computer program product for determining relationships among entity instances in a database, the computer program product stored on a non-transitory computer-readable storage medium and including instructions configured to cause a processor to carry out the steps of:

• accessing a plurality of entity reference relationship structures, each of the plurality of entity reference relationship structures comprising at least a pair of entity instance identifiers that identify a relationship between the entity instances of a pair of entity structures of a plurality of entity structures;
• based on the plurality of entity reference relationship structures, determining each complete graph among all subsets of the plurality of entity structures, wherein each complete graph comprises at least one edge corresponding to an entity reference relationship structure, and two vertices connected by the at least one edge that correspond to entity structures between which the entity reference relationship structure establishes a relationship;
• and
• for each complete graph:
• identifying all matched sets of pairs of entity instance identifiers comprising a pair of entity instance identifiers from each entity reference relationship structure corresponding to the complete graph;
• and
• storing the entity instance identifiers in each matched set in association with each other in an entity relationship structure.

A computing device comprising:

• a communications interface adapted to communicate with a network;
• and
• a control system comprising a processor and coupled to the communications interface, and adapted to:
• access a plurality of entity reference relationship structures, each of the plurality of entity reference relationship structures comprising at least a pair of entity instance identifiers that identify a relationship between entity instances of a pair of entity structures of a plurality of entity structures;
• based on the plurality of entity reference relationship structures, determine each complete graph among all subsets of the plurality of entity structures, wherein each complete graph comprises at least one edge corresponding to an entity reference relationship structure, and two vertices connected by the at least one edge that correspond to entity structures between which the entity reference relationship structure establishes a relationship;
• and
• for each complete graph:
• identify all matched sets of pairs of entity instance identifiers comprising a pair of entity instance identifiers from each entity reference relationship structure corresponding to the complete graph;
• and
• store the entity instance identifiers in each matched set in association with each other in an entity relationship structure.