Example-driven design of efficient record matching queries
US8046339B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jun 5, 2007 |
| Grant date | Oct 25, 2011 |
| Priority date | — |
| Expiry date | Mar 9, 2028 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2458
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Example-driven creation of record matching queries. The disclosed architecture employs techniques that exploit the availability of positive (or matching) and negative (non-matching) examples to search through this space and suggest an initial record matching query. The record matching task is modeled as that of designing an operator tree obtained by composing a few primitive operators. This ensures that record matching programs be executable efficiently and scalably over large input relations. The architecture joins records across multiple (e.g., two) relations (e.g., R and S). The architecture exploits the monotonicity property of similarity functions for record matching in the relations, in that, any pair of matching records have a higher similarity value than non-matching record pairs on at least one similarity function.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.