Record matching system

1. A system for improved efficiency of batch processing of incoming data records, the system comprising:

a database of records; and

at least one server configured to:

receive incoming data records;

generate a plurality of match codes for each of the incoming data records;

compare the match codes to predetermined match codes of the records in the database by utilizing a series of sequential matching strategies that reduces a computational load of the at least one server by, in each sequential matching strategy, comparing at least one match code associated with a respective sequential matching strategy to the predetermined match codes of the records in the database to identify a subset of potential matches and proceeding to a subsequent matching strategy in the series of sequential matching strategies if a match is not found in the subset of potential matches,

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;

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.

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

3. The system of claim 1 , wherein the series of sequential matching strategies further

comprises:

comparing in a first search strategy a first match code to the database of records to identify a first subset of potential matches;

proceeding to a second search strategy when comparing a first match code returns no potential matches; and

comparing in the second search strategy a second match code to the database of records to identify a second subset of potential matches.

4. The system of claim 3 , wherein the series of sequential matching strategies further comprises:

proceeding to a third search strategy when comparing a second match code returns no potential matches; and

comparing in the third search strategy a third match code to the database of records to identify a third subset of potential matches.

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

6. The system of claim 1 , 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.

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

8. The system of claim 1 , 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.

9. A method of processing records, comprising:

receiving, at a server, incoming data records;

generating, at a server, a plurality of match codes for each of the incoming data records;

comparing, at the server, the match codes of the data records to predetermined match codes of the records in a database by utilizing a series of sequential matching strategies that increases an efficiency of the at least one server by, in each sequential matching strategy, comparing at least one match code associated with a respective sequential matching strategy to the predetermined match codes of the records in the database to identify a subset of potential matches;

proceeding to a subsequent matching strategy in the series of sequential matching strategies if a match is not found in the subset of potential matches

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.

10. The method of claim 9 , wherein before the step of generating, at a server, a plurality of match codes, the method further comprises the steps of:

storing, at the server, the incoming data records in a request table.

11. The method of claim 10 , 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.

12. The method of claim 9 , 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 first subset of potential matches;

proceeding to a second 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 second subset of potential matches.

13. The method of claim 12 , wherein the series of sequential matching strategies further comprises:

proceeding to a third 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 fourth subset of potential matches.

14. The method of claim 9 , further comprising:

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.

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

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

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

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