Resolving pairwise links to groups

1. A system comprising:

one or more processing modules; and

one or more non-transitory storage modules storing computing instructions

configured to run on the one or more processing modules and perform acts of:

accessing one or more neighborhood data structures, at least a portion of the one or more neighborhood data structures are active, and the one or more neighborhood data structures each comprise:

a label comprising a record identifier, the record identifier corresponding to a specified record of one or more records;

a neighborhood comprising a list of record identifiers for other records linked to the specified record of the one or more records by a pairwise link; and

a message for each of the other records linked to the specified record of the one or more records, the message comprising the label and an activity state indicator, the activity state indicator indicating if the one or more neighborhood data structure is active;

grouping one of the one or more neighborhood data structures and the message for the one of the one or more neighborhood data structures by the record identifier of the one of the one or more neighborhood data structures;

setting the label for the one of the one or more neighborhood data structures in the group to a minimum record identifier; and

removing the one of the one or more neighborhood data structures from the one or more neighborhood data structures that are active when the minimum record identifier for the one of the one or more neighborhood data structures is the record identifier for the specified record of a particular neighborhood data structure of the one or more neighborhood data structures.

2. The system of claim 1 , wherein: removing the one of the one or more neighborhood data structures from the one or more neighborhood data structures that are active by setting the activity state indicator to indicate that the one of the one or more neighborhood data structures is not active.

3. The system of claim 1 , further comprising: performing the acts for one or more iterations over the one or more records until a stop condition is satisfied.

4. The system of claim 3 , further comprising: writing out the label for each neighborhood data structure of the one or more neighborhood data structures.

5. The system of claim 3 , wherein: the stop condition indicates a specified maximum number of the one or more iterations to perform.

6. The system of claim 3 , wherein: the stop condition is based at least in part on detecting that no neighborhood data structures of the one or more neighborhood data structures are active.

7. The system of claim 1 , wherein: the minimum record identifier is based at least in part on a lexicographical order associated with the record identifiers.

8. The system of claim 1 , wherein: one or more of the one or more records is associated with a retail purchase transaction.

9. A method comprising:

accessing one or more neighborhood data structures, at least a portion of the one or more neighborhood data structures are active, and the one or more neighborhood data structures each comprise:

a label comprising a record identifier, the record identifier corresponding to a specified record of one or more records;

a neighborhood comprising a list of record identifiers for other records linked to the specified record of the one or more records by a pairwise link; and

a message for each of the other records linked to the specified record of the one or more records, the message comprising the label and an activity state indicator, the activity state indicator indicating if the one or more neighborhood data structure is active;

grouping one of the one or more neighborhood data structures and the message for the one of the one or more neighborhood data structures by the record identifier of the one of the one or more neighborhood data structures;

setting the label for the one of the one or more neighborhood data structures in the group to a minimum record identifier; and

removing the one of the one or more neighborhood data structures from the one or more neighborhood data structures that are active when the minimum record identifier for the one of the one or more neighborhood data structures is the record identifier for the specified record of a particular neighborhood data structure of the one or more neighborhood data structures.

10. The method of claim 9 , wherein: removing the one of the one or more neighborhood data structures from the one or more neighborhood data structures that are active by setting the activity state indicator to indicate that the one of the one or more neighborhood data structures is not active.

11. The method of claim 9 , further comprising: performing acts for one or more iterations over the one or more records until a stop condition is satisfied.

12. The method of claim 11 , further comprising: writing out the label for each neighborhood data structure of the one or more neighborhood data structures.

13. The method of claim 11 , wherein: the stop condition indicates a specified maximum number of the one or more iterations to perform.

14. The method of claim 11 , wherein: the stop condition is based at least in part on detecting that no neighborhood data structures of the one or more neighborhood data structures are active.

15. The method of claim 9 , wherein: the minimum record identifier is based at least in part on a lexicographical order associated with the record identifiers.

16. The method of claim 9 , wherein: one or more of the one or more records is associated with a retail purchase transaction.

17. A computer program product comprising non-transitory one or more computer storage devices having stored thereon computer-executable instructions that, when executed at a processor, perform acts comprising:

accessing one or more neighborhood data structures, at least a portion of the one or more neighborhood data structures are active, and the one or more neighborhood data structures each comprise:

a label comprising a record identifier, the record identifier corresponding to a specified record of one or more records;

a neighborhood comprising a list of record identifiers for other records linked to the specified record of the one or more records by a pairwise link; and

a message for each of the other records linked to the specified record of the one or more records, the message comprising the label and an activity state indicator, the activity state indicator indicating if the one or more neighborhood data structures is active;

grouping one of the one or more neighborhood data structures and the message for the one of the one or more neighborhood data structures by the record identifier of the one of the one or more neighborhood data structures;

setting the label for the one of the one or more neighborhood data structures in the group to a minimum record identifier; and

removing the one of the one or more neighborhood data structures from the one or more neighborhood data structures that are active when the minimum record identifier for the one of the one or more neighborhood data structures is the record identifier for the specified record of a particular neighborhood data structure of the one or more neighborhood data structures.

18. The computer program product of claim 17 , wherein:

removing the one of the one or more neighborhood data structures from the one or more neighborhood data structures that are active by setting the activity state indicator to indicate that the one of the one or more neighborhood data structures is not active.

19. The computer program product of claim 17 , wherein: the computer-executable instructions that, when executed at the processor, perform further acts comprising:

performing the acts for one or more iterations over the one or more records until a stop condition is satisfied.

20. The computer program product of claim 19 , wherein: the stop condition is based at least in part on detecting that no neighborhood data structures of the one or more of neighborhood data structures are active.