DYNAMIC RECORD BLOCKING

• US 20130173560A1
• Filed: 01/12/2012
• Published: 07/04/2013
• Est. Priority Date: 01/03/2012
• Status: Active Grant

• Current Assignee: Peopleconnect Incorporated
• Original Assignee: Intelius Incorporated
• Inventors: McNeill, William P., Borthwick, Andrew
• Granted Patent: US 8,645,399 B2
• Time in Patent Office: Days
• US Class Current: 707/692
• CPC Class Codes: G06F 16/215 Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors

Abstract

Dynamic blocking determines which pairs of records in a data set should be examined as potential duplicates. Records are grouped together into blocks by shared properties that are indicators of duplication. Blocks that are too large to be efficiently processed are further subdivided by other properties chosen in a data-driven way. We demonstrate the viability of this algorithm for large data sets. We have scaled this system up to work on billions of records on an 80 node Hadoop cluster.

Claims

1. A method of using a plurality of distributed computing nodes each comprising a processor and associated storage to dynamically block, comprising:

(a) grouping together records of a data set with similar properties into blocks; and

(b) for a block that is intractably large and therefore requires further blocking, automatically discovering based on the contents of the intractably large block, sets of shared properties that enable creation of sub-blocks of tractable size.

2. The method of claim 1 wherein automatically discovering comprises automatically analyzing the set of properties present in records in an oversized block to dynamically guide subdivision of that oversized block.

3. The method of claim 1 further including processing the discovered sets of shared record properties in parallel using the plurality of distributed computing nodes to recursively or iteratively subdivide or partition, based on similar properties, at least one intractably large block into blocks of tractable size.

4. The method of claim 1 further including dynamically adjusting the discovered sets of shared properties in response to the composition of the data set and block size.

5. The method of claim 1 wherein the data set comprises a massive database of personal information from diverse data sources for an online people search.

6. The method of claim 1 wherein discovering applies a ramp parameter by which the maximum number of comparisons in the block of intractable size is increased with each recursion or iteration to provide a data-driven way to trade off between sub-blocking and linkage.

7. The method of claim 1 further including allowing sets of records to overlap.

8. The method of claim 1 further including applying the method to data sets when there is no obvious quickly-calculable metric between records and the number of records makes even a fast calculation for all pairs intractable.

9. The method of claim 1 further including creating multiple top-level blocks that can be worked on independently and in parallel.

10. The method of claim 1 further including dynamically adjusting the creation of sub-blocks based on several record property dimensions along which the records may vary, thereby avoiding the need to define a single ordering that places similar records next to each other.

11. The method of claim 1 further including allowing maximum block size to be a function of block key length.

12. A system for dynamically blocking comprising:

a plurality of distributed computing nodes each comprising a processor and associated non-transitory memory, the nodes each storing in non-transitory storage codes that when executed in parallel;

groups together records of a data set with similar properties into blocks; and

for a block that is intractably large and therefore requires further blocking, automatically discovers based on the contents of the intractably large block, sets of shared properties that enable creation of sub-blocks of tractable size.

13. The system of claim 12 wherein the code automatically analyzes the set of properties present in records in an oversized block to dynamically guide subdivision into sub-blocks.

14. The system of claim 12 wherein the processors process the discovered sets of shared record properties in parallel to recursively or iteratively subdivide or partition, based on similar properties, at least one intractably large block into blocks of tractable size.

15. The system of claim 12 wherein the processors dynamically adjust the discovered sets of shared properties in response to the composition of the data set and block size.

16. The system of claim 12 wherein the data set comprises a massive database of personal information from diverse data sources for an online people search.

17. The system of claim 12 wherein the processors apply a ramp parameter by which the maximum number of comparisons in the block of intractable size is increased with each recursion or iteration to provide a data-driven way to trade off between sub-blocking and linkage.

18. The system of claim 12 wherein the processors allow sets of records to overlap.

19. The system of claim 12 wherein the processors apply reduction to data sets when there is no obvious quickly-calculable metric between records and the number of records makes even a fast calculation for all pairs intractable.

20. The system of claim 12 wherein the processors create multiple top-level blocks that can be worked on independently and in parallel.

21. The system of claim 12 wherein the processors dynamically adjust the creation of sub-blocks based on several record property dimensions along which the records may vary, thereby avoiding the need to define a single ordering that places similar records next to each other.

22. The system of claim 12 further including allowing maximum block size to be a function of block key length.