US 11,693,821 B2
Systems and methods for performant data matching
Curtiss W. Schuler, Glendale, AZ (US); Brett A. Norris, North Vancouver (CA); and Satyender Goel, Chicago, IL (US)
Assigned to Collibra Belgium BV, Brussels (BE)
Filed by Collibra Belgium BV, Brussels (BE)
Filed on Jul. 7, 2021, as Appl. No. 17/369,798.
Prior Publication US 2023/0014556 A1, Jan. 19, 2023
Int. Cl. G06F 16/14 (2019.01); G06F 16/13 (2019.01)
CPC G06F 16/152 (2019.01) [G06F 16/137 (2019.01)] 19 Claims
OG exemplary drawing
 
1. 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.