Matching objects using keys based on match rules

• US 9,740,743 B2
• Filed: 10/20/2014
• Issued: 08/22/2017
• Est. Priority Date: 10/20/2014
• Status: Active Grant

• Current Assignee: Salesforce.com, Inc.
• Original Assignee: Salesforce.com, Inc.
• Inventors: Jagota, Arun, Ker, Chenghung, Vaishnav, Parth Vijay, Dvinov, Danil, Hacker, David, Levine, Susan
• Primary Examiner(s): Arjomandi, Noosha
• Application Number:
  US14/518,145
• Publication Number:
  US 20160110354A1
• Time in Patent Office: 1,037 Days
• CPC Class Codes: G06F 16/24556 Aggregation; Duplicate elimination

Abstract

Matching objects using keys based on match rules is described. A system generates a match rule key based on a match rule, wherein the match rule specifies whether two objects match. The system creates candidate keys by applying the match rule key to data objects. The system creates a probe key by applying the match rule key to a probe object. The system determines whether the probe key matches a candidate key. The system determines whether the probe object matches a candidate object based on applying the match rule to the probe object and the candidate object if the probe key matches the candidate key corresponding to the candidate object. The system identifies the probe object and the candidate object as matching based on the match rule if the probe object matches the candidate object.

Claims

1. A system for matching objects using keys based on match rules, the apparatus comprising:

one or more processors; and

a non-transitory computer readable medium storing a plurality of instructions, which when executed, cause the one or more processors to;

generate a match rule key based on a match rule, wherein the match rule specifies whether two objects match;

create a plurality of candidate keys by applying the match rule key to a plurality of data objects;

create a probe key by applying the match rule key to a probe object;

determine whether the probe key matches a candidate key of the plurality of candidate keys;

determine whether the probe object matches a candidate object based on applying the match rule to the probe object and the candidate object in response to a determination that the probe key matches the candidate key corresponding to the candidate object; and

identify the probe object and the candidate object as matching based on the match rule in response to a determination that the probe object matches the candidate object, the match rule identifying a match of the probe object and the candidate object unless both the probe object and the candidate object have corresponding non-empty fields that lack a match.

2. The system of claim 1, wherein the match rule is expressed in disjunctive normal form.

3. The system of claim 1, wherein at least one of the probe key matching any candidate database key and the probe object matching a candidate object is based on at least one of an exact match and fuzzy matching.

4. The system of claim 1, wherein the match rule identifies a match based on a null value for a field of the probe object deemed as matching a null value for a field of the candidate object.

5. The system of claim 1, wherein the match rule identifies a match based on a corresponding field of the probe object and the candidate object having matching non-empty values.

6. The system of claim 1, wherein the plurality of data objects comprises a plurality of customer relationship management objects.

7. A computer program product comprising computer-readable program code to be executed by one or more processors when retrieved from a non-transitory computer-readable medium, the program code including instructions to:

generate a match rule key based on a match rule, wherein the match rule specifies whether two objects match;

create a plurality of candidate keys by applying the match rule key to a plurality of data objects;

create a probe key by applying the match rule key to a probe object;

determine whether the probe key matches a candidate key of the plurality of candidate keys;

determine whether the probe object matches a candidate object based on applying the match rule to the probe object and the candidate object in response to a determination that the probe key matches the candidate key corresponding to the candidate object; and

identify the probe object and the candidate object as matching based on the match rule in response to a determination that the probe object matches the candidate object, the match rule identifying a match of the probe object and the candidate object unless both the probe object and the candidate object have corresponding non-empty fields that lack a match.

8. The computer program product of claim 7, wherein the match rule is expressed in disjunctive normal form.

9. The computer program product of claim 7, wherein at least one of the probe key matching any candidate database key and the probe object matching a candidate object is based on at least one of an exact match and fuzzy matching.

10. The computer program product of claim 7, wherein the match rule identifies a match based on a null value for a field of the probe object deemed as matching a null value for a field of the candidate object.

11. The computer program product of claim 7, wherein the match rule identifies a match based on a corresponding field of the probe object and the candidate object having matching non-empty values.

12. The computer program product of claim 7, wherein the plurality of data objects comprises a plurality of customer relationship management objects.

13. A method for matching objects using keys based on match rules, the method comprising:

generating a match rule key based on a match rule, wherein the match rule specifies whether two objects match;

creating a plurality of candidate keys by applying the match rule key to a plurality of data objects;

creating a probe key by applying the match rule key to a probe object;

determining whether the probe key matches a candidate key of the plurality of candidate keys;

determining whether the probe object matches a candidate object based on applying the match rule to the probe object and the candidate object in response to a determination that the probe key matches the candidate key corresponding to the candidate object; and

identifying the probe object and the candidate object as matching based on the match rule in response to a determination that the probe object matches the candidate object, the match rule identifying a match of the probe object and the candidate object unless both the probe object and the candidate object have corresponding non-empty fields that lack a match.

14. The method of claim 13, wherein the match rule is expressed in disjunctive normal form.

15. The method of claim 13, wherein at least one of the probe key matching any candidate database key and the probe object matching a candidate object is based on at least one of an exact match and fuzzy matching.

16. The method of claim 13, wherein the match rule identifies a match based on a null value for a field of the probe object deemed as matching a null value for a field of the candidate object.

17. The method of claim 13, wherein the match rule identifies a match based on a corresponding field of the probe object and the candidate object having matching non-empty values.