# US 2018/0025059 A1 · Record matching system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0025059 A1
- Document ID: US20180025059A1
- Status: Published application
- Kind: A1
- Application number: 15/593,024
- Filed: 2017-05-11
- Published: 2018-01-25
- Earliest claimed: 2016-07-22
- Assignees: National Student Clearinghouse
- Applicants: National Student Clearinghouse
- Inventors: Ravi Batchu; Manish Ganotra; Diana Gillum; Joolee Tao; Steven Truesdale
- Web page: https://patentgrep.com/patent/US20180025059A1

## CPC

- G06F 16/24564: {Applying rules; Deductive queries}
- G06F 16/215: Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The present invention discloses methods and systems for an improved Enterprise Matching Service (“EMS”) that is designed to match incoming data records to a database of records, using less system resources and using those resources more efficiently. The EMS identifies potential matches by generating unique identifiers and match codes for incoming data records, and then matching the unique identifiers and match codes to pre-generated unique identifiers and match codes for database records. Various match sensitivities are embedded in the pre-generated match codes, so an extensive match is handled by a simplistic “one to one” match between match codes in order to identify a subset of potential matches. Once a subset of potential matches are identified, the methods and systems weigh the subset of potential matches to determine whether there is a match.

## Claims

### Claim 1

A system for improved efficiency of batch processing of incoming data records, the system comprising:
at least one server; and
a database of records;
wherein the at least one server is configured to:
receive incoming data records;
store the incoming data records in a request table;
cleanse the incoming data records;
generate a plurality of match codes for each of the incoming data records; and
compare the match codes of the incoming data records to predetermined match codes of the records in the database by utilizing a series of sequential matching strategies, wherein the series of sequential matching strategies reduces a computational load of the at least one server by comparing one match code at a time to match codes of the records in the database to identify a subset of potential matches.

### Claim 2 (depends on 1)

The system of claim 1, wherein the at least one server is further configured to:
weigh the records in the subset of potential matches; and
identify from the subset of potential matches any record that meets a threshold value.

### Claim 3 (depends on 2)

The system of claim 2, wherein the series of sequential matching strategies further comprises:
comparing a first match code to the database of records to identify a subset of potential matches;
proceeding to a subsequent search strategy when comparing a first match code returns no potential matches; and
comparing a second match code to the database of records to identify a subset of potential matches.

### Claim 4 (depends on 3)

The system of claim 3, wherein the series of sequential matching strategies further comprises:
proceeding to a subsequent search strategy when comparing a second match code returns no potential matches; and
comparing a third match code to the database of records to identify a subset of potential matches.

### Claim 5 (depends on 4)

The system of claim 4, wherein the series of sequential matching strategies further comprises:
proceeding to a subsequent search strategy when comparing a third match code returns no potential matches; and
comparing a fourth match code to the database of records to identify a subset of potential matches.

### Claim 6 (depends on 5)

The system of claim 5, wherein the series of sequential matching strategies further comprises:
proceeding to a subsequent search strategy when comparing a fourth match code returns no potential matches; and
comparing a fifth match code to the database of records to identify a subset of potential matches.

### Claim 7 (depends on 6)

The system of claim 6, wherein the series of sequential matching strategies further comprises:
proceeding to a subsequent search strategy when comparing a fifth match code returns no potential matches; and
comparing a sixth match code to the database of records to identify a subset of potential matches.

### Claim 8 (depends on 7)

The system of claim 7, wherein the at least server is further configured to return no matches when the series of sequential matching strategies returns no potential matches.

### Claim 9 (depends on 1)

The system of claim 1, wherein the at least one server is further configured to:
weigh the records in the subset of potential matches, wherein weighing the records comprises:
comparing a plurality of attributes of the incoming data record to the subset of potential matches;
returning a weighted value associated with each of the plurality of attributes;
summing the weighted values; and
comparing the sum of the weighted values to the threshold value; and
identifying from the subset of potential matches data records that meet the threshold value,
wherein comparing a plurality of attributes of the incoming data record to the subset of potential matches increases efficiency of the at least one server by reducing a total number of data records that the plurality of attributes are compared to; and
wherein comparing a plurality of attributes, returning a weighted value, summing the weighted value, and comparing the weighted value to the threshold value increases the accuracy of the at least one server by permitting the subset of potential matches to be evaluated according to the plurality of attributes.

### Claim 10 (depends on 9)

The system of claim 9, wherein when one data record meets the threshold value, the at least one server returns a match.

### Claim 11 (depends on 9)

The system of claim 9, wherein when a plurality of data records meet the threshold value, the at least one server returns all of the plurality of data records as matches.

### Claim 12 (depends on 9)

The system of claim 9, wherein when a plurality of data records meet the threshold value, the at least one server returns a highest-scored record as a match.

### Claim 13 (depends on 9)

The system of claim 9, wherein when a plurality of data records meet the threshold value, the at least one server sets a flag on each of the plurality of data records.

### Claim 14 (depends on 2)

The system of claim 2, wherein the system further comprises:
a second server, wherein the second server is configured to:
receive the request table from the first server;
cleanse the incoming data records in the request table; and
generate a plurality of match codes for each of the incoming data records.

### Claim 15 (depends on 14)

The system of claim 14, wherein the system further comprises:
a third server, wherein the third server is configured to perform the steps of:
comparing the match codes of the incoming data records to predetermined match codes of the records in the database by utilizing a series of sequential matching strategies to identify a subset of potential matches;
weighing the records in the subset of potential matches; and
identifying from the subset of potential matches any record that meets a threshold value.

### Claim 16

A method of processing records, comprising:
storing, at a server, a plurality data records in a request table;
generating, at a server, a plurality of match codes for each of the plurality of data records in the request table;
comparing, at a server, the match codes of the data records in the request table to predetermined match codes of a plurality of records in a database by utilizing a series of sequential matching strategies to identify a subset of potential matches;
weighing, at a server, the records in the subset of potential matches; and
identifying, at a server, any record from the subset of potential matches that meets a threshold value;
wherein the series of sequential matching strategies increases an efficiency of a server by comparing one match code at a time to match codes of the plurality of records in the database to identify a subset of potential matches.

### Claim 17 (depends on 16)

The method of claim 16, wherein before the step of storing, at a server, a plurality of data records in a request table, the method further comprises the steps of:
receiving, at a server, a plurality of incoming data records; and
storing, at the server, the incoming data records in the request table.

### Claim 18 (depends on 17)

The method of claim 17, wherein after the step of storing, at a server, the plurality of incoming data records in the request table, the method further comprises the step of:
cleansing, at a server, the data records stored in the request table.

### Claim 19 (depends on 18)

The method of claim 18, wherein the series of sequential matching strategies further comprises:
comparing a first match code to the plurality of records in the database to identify a subset of potential matches;
proceeding to a subsequent search strategy when comparing a first match code returns no potential matches; and
comparing a second match code to the plurality of records in the database to identify a subset of potential matches.

### Claim 20 (depends on 19)

The method of claim 19, wherein the series of sequential matching strategies further comprises:
proceeding to a subsequent search strategy when comparing a second match code returns no potential matches; and
comparing a third match code to the plurality of records in the database to identify a subset of potential matches.

### Claim 21 (depends on 20)

The method of claim 20, wherein the series of sequential matching strategies further comprises:
proceeding to a subsequent search strategy when comparing a third match code returns no potential matches; and
comparing a fourth match code to the plurality of records in the database to identify a subset of potential matches.

### Claim 22 (depends on 21)

The method of claim 21, wherein the series of sequential matching strategies further comprises:
proceeding to a subsequent search strategy when comparing a fourth match code returns no potential matches; and
comparing a fifth match code to the plurality of records in the database to identify a subset of potential matches.

### Claim 23 (depends on 22)

The method of claim 22, wherein the series of sequential matching strategies further comprises:
proceeding to a subsequent search strategy when comparing a fifth match code returns no potential matches; and
comparing a sixth match code to the plurality of records in the database to identify a subset of potential matches.

### Claim 24 (depends on 23)

The method of claim 23, wherein the server is further configured to return no matches when the series of sequential matching strategies returns no potential matches.

### Claim 25 (depends on 18)

The method of claim 18, wherein the step of weighing the records in the subset of potential matches comprises:
comparing a plurality of attributes of each incoming data record to the subset of potential matches;
returning a weighted value associated with each of the plurality of attributes;
summing the weighted values; and
comparing the sum of the weighted values to the threshold value,
wherein comparing a plurality of attributes of each incoming data record to the subset of potential matches increases efficiency of the server by reducing a total number of data records that the plurality of attributes are compared to; and
wherein comparing a plurality of attributes, returning a weighted value, summing the weighted values, and comparing the weighted values to the threshold value increases the accuracy of the server by permitting the subset of potential matches to be evaluated according to the plurality of attributes.

### Claim 26 (depends on 25)

The method of claim 25, wherein the step of identifying, at a server, any record from the subset of potential matches that meets a threshold value comprises:
returning a match when the sum of the weighted values of a record in the database meets the threshold value.

### Claim 27 (depends on 26)

The method of claim 26, wherein the step of identifying, at a server, any record from the subset of potential matches that meets a threshold value comprises:
returning a plurality of matches when the sums of the weighted values of a plurality of records in the database meet the threshold value.

### Claim 28 (depends on 26)

The method of claim 26, wherein the step of identifying, at a server, any record from the subset of potential matches that meets a threshold value comprises:
setting a flag on each of the plurality of data records when the sums of the weighted values of a plurality of records in the database meet the threshold value.

### Claim 29 (depends on 26)

The method of claim 26, wherein the step of identifying, at a server, any record from the subset of potential matches that meets a threshold value comprises:
returning a highest-scored record as a match when the sums of the weighted values of a plurality of records in the database meet the threshold value.

### Claim 30 (depends on 18)

The method of claim 18, wherein a second server performs the steps of:
cleansing the incoming data records in the request table; and
generating a plurality of match codes for each of the incoming data records.

### Claim 31 (depends on 30)

The method of claim 30, wherein a third server performs the steps of:
comparing the match codes of the incoming data records to predetermined match codes of the records in the database by utilizing a series of sequential matching strategies to identify a subset of potential matches;
weighing the records in the subset of potential matches; and
identifying from the subset of potential matches any record that meets a threshold value.
