Vector Space Lightweight Directory Access Protocol Data Search

• US 20100010973A1
• Filed: 07/09/2008
• Published: 01/14/2010
• Est. Priority Date: 07/09/2008
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Harrington, Nathan John
• Granted Patent: US 8,918,383 B2
• Time in Patent Office: Days
• US Class Current: N/A
• CPC Class Codes: G06F 16/332 Query formulation
• CPC Class Codes: G06F 16/3343 using phonetics

Abstract

A computer-implemented method, apparatus, and computer program product for performing a search for data. In one embodiment, the process converts each character of the search query into a phonetic variant to form an inflected search query. The process then identifies a set of inflected data fields of a vector space library satisfying the inflected search query. The set of inflected data fields are formed from a set of lightweight directory access protocol data fields of a set of lightweight directory access protocol records. Thereafter, the process generates a search result listing records of the set of records satisfying the search query.

Claims

1. A computer implemented method for searching data, the computer implemented method comprising:

responsive to receiving a search query converting each character of the search query into a phonetic variant to form an inflected search query;

identifying a set of inflected data fields of a vector space library satisfying the inflected search query, wherein the set of inflected data fields are formed from a set of lightweight directory access protocol data fields of a set of lightweight directory access protocol records; and

generating a search result listing records of the set of lightweight directory access protocol records satisfying the search query.

2. The computer implemented method of claim 1, further comprising:

calculating a relevancy score for the records of the set of lightweight directory access protocol records that satisfies the inflected search query.

3. The computer implemented method of claim 1, wherein the generating step further comprises:

sorting the records according to a relevance score, wherein the relevance score is calculated from a comparison of a first set of phonetic variants of the inflected search query and a second set of phonetic variants of an inflected data field.

4. The computer implemented method of claim 1 further comprising:

generating an alphanumeric phonetic hash, wherein the alphanumeric phonetic hash is used for transform a set of alphanumeric characters into a set of alphanumeric variants.

5. The computer implemented method of claim 1, further comprising:

generating the vector space library having the set of inflected data fields using an alphanumeric hash, wherein the set of inflected data fields are formed from a set of lightweight directory access protocol data fields.

6. A computer program product for searching data, the computer program product comprising:

a computer recordable-type medium;

first program instructions for converting each character of the search query into a phonetic variant to form an inflected search query in response to receiving a search query;

second program instructions for identifying a set of inflected data fields of a vector space library satisfying the inflected search query, wherein the set of inflected data fields are formed from a set of lightweight directory access protocol data fields of a set of lightweight directory access protocol records;

third program instructions for generating a search result listing records of the set of records satisfying the search query; and

wherein the first program instructions, the second program instructions, and the third program instructions are stored on the computer recordable-type medium.

7. The computer program product of claim 6, further comprising:

fourth program instructions for calculating a relevance score for the records of the set of records that satisfies the inflected search query, wherein the fourth program instructions are stored on the computer recordable-type medium.

8. The computer program product of claim 6, further comprising:

fifth program instructions for sorting the records according to a relevance score, wherein the relevance score is calculated from a comparison of a first set of phonetic variants of the inflected search query and a second set of phonetic variants of an inflected data field, wherein the fifth program instructions are stored on the computer recordable-type medium.

9. The computer program product of claim 6, wherein the third program instructions further comprises:

sixth program instructions for generating an alphanumeric phonetic hash, wherein the alphanumeric phonetic hash is used for transform a set of alphanumeric characters into a set of alphanumeric variants, wherein the sixth program instructions are stored on the computer recordable-type medium.

10. The computer program product of claim 6 further comprising:

seventh program instructions for generating the vector space library having the set of inflected data fields using an alphanumeric hash, wherein the set of inflected data fields are formed from a set of lightweight directory access protocol data fields, and wherein the seventh program instructions are stored on the computer recordable-type medium.

11. An apparatus for searching data, the apparatus comprising:

a bus system;

a memory connected to the bus system, wherein the memory includes computer usable program code; and

a processing unit connected to the bus system, wherein the processing unit executes the computer usable program code to convert each character of the search query into a phonetic variant to form an inflected search query in response to receiving a search query;

identify a set of inflected data fields of a vector space library satisfying the inflected search query, wherein the set of inflected data fields are formed from a set of lightweight directory access protocol data fields of a set of lightweight directory access protocol records; and

generate a search result listing records of the set of records satisfying the search query.

12. The apparatus of claim 11, wherein the processing unit further executes the computer usable program code to calculate a relevance score for the records of the set of records that satisfies the inflected search query.

13. The apparatus of claim 11, wherein the processing unit further executes the computer usable program code to sort the records according to a relevance score, wherein the relevance score is calculated from a comparison of a first set of phonetic variants of the inflected search query and a second set of phonetic variants of an inflected data field.

14. The apparatus of claim 11, wherein the processing unit further executes the computer usable program code to generate an alphanumeric phonetic hash, wherein the alphanumeric phonetic hash is used for transform a set of alphanumeric characters into a set of alphanumeric variants.

15. The apparatus of claim 11, wherein the processing unit further executes the computer usable program code to generate the vector space library having the set of inflected data fields using an alphanumeric hash, wherein the set of inflected data fields are formed from a set of lightweight directory access protocol data fields.

16. A system for searching data, the system comprising:

a storage device, wherein the storage device stores a vector space library comprising a set of inflected data fields, and wherein the set of inflected data fields are formed from a set of lightweight directory access protocol data fields; and

a vector space module, wherein the vector space module converts each character of the search query into a phonetic variant to form an inflected search query in response to receiving a search query;

identifies a set of inflected data fields of a vector space library satisfying the inflected search query, wherein the set of inflected data fields are formed from a set of lightweight directory access protocol data fields of a set of lightweight directory access protocol records; and

generates a search result listing records of the set of records satisfying the search query.

17. The system of claim 16, wherein the a vector space module calculates a relevance score for the records of the set of records that satisfies the inflected search query.

18. The system of claim 16, wherein the a vector space module sorts the records according to a relevance score, wherein the relevance score is calculated from a comparison of a first set of phonetic variants of the inflected search query and a second set of phonetic variants of an inflected data field.

19. The system of claim 16, wherein the a vector space module generate an alphanumeric phonetic hash, wherein the alphanumeric phonetic hash is used for transform a set of alphanumeric characters into a set of alphanumeric variants.

20. The system of claim 16, wherein the a vector space module generate the vector space library having the set of inflected data fields using an alphanumeric hash, wherein the set of inflected data fields are formed from a set of lightweight directory access protocol data fields.