Matching objects using keys based on match rules

Patent metadata

Field	Value
Publication number	US-2016110354-A1
Application number	US-201414518145-A
Country	US
Kind code	A1
Filing date	Oct 20, 2014
Priority date	Oct 20, 2014
Publication date	Apr 21, 2016
Grant date	—

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.

First claim

What is claimed is:

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.

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 rules identifies a match based on a corresponding field of the probe object and the candidate object having non-empty values and the non-empty values matching for the corresponding field.

6 . The system of claim 1 , wherein the match rule identifies a match of the probe object and the candidate object unless both the probe object and the candidate object have corresponding non-empty fields and the corresponding non-empty fields lack a match.

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

8 . 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.

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

10 . The computer program product of claim 8 , 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.

11 . The computer program product of claim 8 , 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.

12 . The computer program product of claim 8 , wherein the match rules identifies a match based on a corresponding field of the probe object and the candidate object having non-empty values and the non-empty values matching for the corresponding field.

13 . The computer program product of claim 8 , wherein the match rule identifies a match of the probe object and the candidate object unless both the probe object and the candidate object have corresponding non-empty fields and the corresponding non-empty fields lack a match.

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

15 . 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.

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

17 . The method of claim 15 , 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.

18 . The method of claim 15 , 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.

19 . The method of claim 15 , wherein the match rules identifies a match based on a corresponding field of the probe object and the candidate object having non-empty values and the non-empty values matching for the corresponding field.

20 . The method of claim 15 , wherein the match rule identifies a match of the probe object and the candidate object unless both the probe object and the candidate object have corresponding non-empty fields and the corresponding non-empty fields lack a match.

Assignees

• Salesforce Com Inc

Inventors

• Jagota Arun
• Ker Chenghung
• Vaishnav Parth Vijay
• Dvinov Danil
• Hacker David
• Levine Susan

Classifications

• G06F16/24556 Primary

  Aggregation; Duplicate elimination · CPC title

• G06F17/30386

  Physics · mapped topic

• G06F17/3015 Primary

  Physics · mapped topic