System and method for searching and matching databases

• US 20080235174A1
• Filed: 06/02/2008
• Published: 09/25/2008
• Est. Priority Date: 11/08/2002
• Status: Active Grant

• Current Assignee: Dun & Bradstreet Corp., DUN & Bradstreet Incorporated (Dun & Bradstreet Corp.), Hoover's Incorporated (Dun & Bradstreet Holdings, Inc.)
• Original Assignee: DUN & Bradstreet Incorporated (Dun & Bradstreet Corp.)
• Inventors: Gustafson, Eric, Skahill, Larry, Scriffignano, Anthony J., Hayenhjelm, Amy, Shipman, Courtney, Allaway, David, Pillai, Ajay, Ohlson, Edward, Chakraborty, Sudip
• Granted Patent: US 8,768,914 B2
• Time in Patent Office: Days
• US Class Current: 706/52
• CPC Class Codes: G06F 16/245 Query processing
• CPC Class Codes: G06F 16/2468 Fuzzy queries
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation

Abstract

There is provided a method for searching a database to obtain data. The method includes (a) prioritizing a set of keys that are derived from a match inquiry, thus yielding a prioritized set of keys, wherein the prioritizing is based on, for each key of the set, an efficacy of using the key, (b) determining a subset of the prioritized set, and (c) retrieving, using the subset, a set of candidates for satisfying the match inquiry.

Claims

1. A method comprising:

prioritizing a set of keys that are derived from a match inquiry, thus yielding a prioritized set of keys, wherein said prioritizing is based on, for each key of said set, an efficacy of using said key;

determining a subset of said prioritized set; and

retrieving, using said subset, a set of candidates for satisfying said match inquiry.

2. The method of claim 1, wherein said retrieving is performed until either (a) all of said subset has been employed, or (b) a high-confidence candidate has been retrieved.

3. The method of claim 1, wherein said determining said subset comprises:

considering a limit on an amount of time allocated to retrieve said set of candidates.

4. The method of claim 1, further comprising, for each candidate of said set of candidates:

assigning a match string indicative of a similarity between corresponding attributes of said match inquiry and said candidate; and

determining, from said match string, a confidence code that indicates a class of similarity between said match inquiry and said candidate.

5. The method of claim 4, further comprising:

determining, from said set of candidates, a subset having a highest confidence code; and

selecting, from said subset having said highest confidence code, a best match to said match inquiry.

6. The method of claim 5, further comprising:

determining, for said best match, a descriptive variable that provides information about an attribute of said best match.

7. The method of claim 6, further comprising:

outputting said best match, said confidence code, said match string, and said descriptive variable.

8. The method of claim 1, wherein said prioritizing comprises, for each key of said set of keys:

considering a complexity of using said key.

9. The method of claim 1, wherein said prioritizing comprises, for each key of said set of keys:

considering a likelihood of retrieving a most appropriate match using said key.

10. The method of claim 1, wherein said prioritizing comprises, for each key of said set of keys:

considering a quantity of candidates that would be retrieved using said key.

13. The system of claim 1, wherein said determining said subset comprises:

considering a limit on an amount of time allocated to retrieve said set of candidates.

11. A system comprising a processor that performs a method that includes:

prioritizing a set of keys that are derived from a match inquiry, thus yielding a prioritized set of keys, wherein said prioritizing is based on, for each key of said set, an efficacy of using said key;

determining a subset of said prioritized set; and

retrieving, using said subset, a set of candidates for satisfying said match inquiry.

12. The system of claim 11, wherein said retrieving is performed until either (a) all of said subset has been employed, or (b) a high-confidence candidate has been retrieved.

14. The system of claim 11, wherein said method further comprises, for each candidate of said set of candidates:

assigning a match string indicative of a similarity between corresponding attributes of said match inquiry and said candidate; and

determining, from said match string, a confidence code that indicates a class of similarity between said match inquiry and said candidate.

15. The system of claim 14, wherein said method further comprises:

determining, from said set of candidates, a subset having a highest confidence code; and

selecting, from said subset having said highest confidence code, a best match to said match inquiry.

16. The system of claim 15, wherein said method further comprises:

determining, for said best match, a descriptive variable that provides information about an attribute of said best match.

17. The system of claim 16, wherein said method further comprises:

outputting said best match, said confidence code, said match string, and said descriptive variable.

18. The system of claim 11, wherein said prioritizing comprises, for each key of said set of keys:

considering a complexity of using said key.

19. The system of claim 11, wherein said prioritizing comprises, for each key of said set of keys:

considering a likelihood of retrieving a most appropriate match using said key.

20. The system of claim 11, wherein said prioritizing comprises, for each key of said set of keys:

considering a quantity of candidates that would be retrieved using said key.

21. A computer readable medium comprising a program encoded thereon that is executable in a processor to perform a method that includes:

prioritizing a set of keys that are derived from a match inquiry, thus yielding a prioritized set of keys, wherein said prioritizing is based on, for each key of said set, an efficacy of using said key;

determining a subset of said prioritized set; and

retrieving, using said subset, a set of candidates for satisfying said match inquiry.