US 11,693,821 B2Granted

Systems and methods for performant data matching

AssigneeCollibra Belgium BV

InventorsCurtiss W. Schuler, Brett A. Norris, Satyender Goel

Life of this patent

Estimating the term…

Loading patent…

Abstract

The present disclosure is directed to systems and methods for performant data matching. Entities maintain large amounts of data and desire to reconcile duplicative records. One way to solve this problem is through data matching. However, standard data matching at the record level can be laborious and inefficient. To remedy these inefficiencies in data matching, the present disclosure describes a system where the token records are tokenized a second time into token sets based on the token records satisfying at least one token set rule. A token set rule may be based on the common presence of multiple tokens in a token record. If multiple token records have the required tokens from the set rule, then those token records can be hashed and rolled-up into the token set (i.e., tokenized a second time into the token set). The token set allows for more efficient data matching.

Claims19

Dependent claims

A system for data matching, comprising:

a memory configured to store non-transitory computer readable instructions;
and
a processor communicatively coupled to the memory, wherein the processor, when executing the non-transitory computer readable instructions, is configured to:
receive at least one token record from a first source;
receive at least one token record from a second source;
compare the at least one token record from the first source to the at least one token record from the second source;
based on the comparison of the at least one token record from the first source to the at least one token from the second source, identify at least one common token in the at least one token record from the first source and in the at least one token record from the second source, wherein the at least one common token is associated with at least one set rule;
based on the at least one set rule, match the at least one token record from the first source to the at least one token record from the second source;
and
generate a token set by merging the at least one token record from the first source with the at least one token record from the second source using at least one hashing roll-up function, wherein the token set comprises the at least one token record from the first source and the at least one token record from the second source.

7 more elements

Dependencies are inferred from the claim text.