Vector space lightweight directory access protocol data search

• US 8,918,383 B2
• Filed: 07/09/2008
• Issued: 12/23/2014
• Est. Priority Date: 07/09/2008
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Harrington, Nathan John
• Primary Examiner(s): Lin, Shew-Fen
• Assistant Examiner(s): MINCEY, JERMAINE A
• Application Number:
  US12/169,915
• Publication Number:
  US 20100010973A1
• Time in Patent Office: 2,358 Days
• US Class Current: 707/706
• 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 alphanumeric character of the search query comprising one or more alphanumeric characters from a set of alphanumeric characters comprising letters ranging from A-Z and numbers ranging from 0-9 into a respective corresponding phonetic variant in a one to one relationship to form an inflected search query using an alphanumeric phonetic hash that includes a mapping of the set of alphanumeric characters, into a corresponding set of phonetic variants, wherein each phonetic variant is represented as a spelled out word that corresponds to a unique character in the set of alphanumeric characters, and wherein the inflected search query is a vector space having a set of vectors wherein each vector corresponds to a respective individual alphanumeric character of the 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, wherein an inflected data field is a vector space comprising a group of vectors;

calculating a relevancy score for the records of the set of lightweight directory access protocol records that satisfies the inflected search query, wherein the relevancy score is calculated as a percentage of vectors of an inflected data field that are in common with the vectors of the inflected search query;

determining whether the relevancy score meets a modifiable predetermined threshold;

calculating search parameters as a percentage of vectors of the inflected search query that are in common with the vectors of the inflected data field; and

responsive to the relevancy score meets the modifiable predetermined threshold, generating a search result listing records of the set of lightweight directory access protocol records satisfying the search query and conforming to the searching parameters.

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

sorting the records according to the relevancy score, wherein the relevancy 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.

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

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

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

a computer readable-type storage medium storing executable instructions;

first program instructions for converting each alphanumeric character of a search query comprising one or more alphanumeric characters from a set of alphanumeric characters comprising letters ranging from A-Z and numbers ranging from 0-9 into a respective corresponding phonetic variant in a one to one relationship to form an inflected search query in response to receiving a search query using an alphanumeric phonetic hash that includes a mapping of the set of alphanumeric characters into a corresponding set of phonetic variants, wherein each phonetic variant is represented as a spelled out word that corresponds to a unique character in the set of alphanumeric characters, and wherein the inflected search query is a vector space having a set of vectors wherein each vector corresponds to a respective individual alphanumeric character of the 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, wherein an inflected data field is a vector space comprising a group of vectors;

third program instructions for calculating a relevancy score for the records of the set of records that satisfies the inflected search query, wherein the relevancy score is calculated as a percentage of vectors of an inflected data field that are in common with the vectors of the inflected search query;

fourth program instructions for determining whether the relevancy score meets a modifiable predetermined threshold;

fifth program instructions for calculating search parameters as a percentage of vectors of the inflected search query that are in common with the vectors of the inflected data field; and

sixth program instructions, responsive to the relevancy score meets the modifiable predetermined threshold, for generating a search result listing records of the set of records satisfying the search query and conforming to the searching parameters, wherein the first program instructions, the second program instructions, the third program instructions, the fourth program instructions, the fifth program instructions, and the sixth program instructions are stored on the computer readable-type storage medium.

5. The computer program product of claim 4, further comprising:

seventh program instructions for sorting the records according to the relevancy score, wherein the relevancy 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 seventh program instructions are stored on the computer readable-type storage medium.

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

eighth 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 eighth program instructions are stored on the computer readable-type storage medium.

7. 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 alphanumeric character of a search query comprising one or more alphanumeric characters from a set of alphanumeric characters comprising letters ranging from A-Z and numbers ranging from 0-9 into a respective corresponding phonetic variant in a one to one relationship to form an inflected search query in response to receiving a search query using an alphanumeric phonetic hash that includes a mapping of the set of alphanumeric characters into a corresponding set of phonetic variants, wherein each phonetic variant is represented as a spelled out word that corresponds to a unique character in the set of alphanumeric characters, and wherein the inflected search query is a vector space having a set of vectors wherein each vector corresponds to a respective individual alphanumeric character of the 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, wherein an inflected data field is a vector space comprising a group of vectors;

calculate a relevancy score for the records of the set of records that satisfies the inflected search query, wherein the relevancy score is calculated as a percentage of vectors of an inflected data field that are in common with the vectors of the inflected search query;

determine whether the relevancy score meets a modifiable predetermined threshold;

calculate search parameters as a percentage of vectors of the inflected search query that are in common with the vectors of the inflected data field; and

responsive to the relevancy score meets the modifiable predetermined threshold, generate a search result listing records of the set of records satisfying the search query and conforming to the searching parameters.

8. The apparatus of claim 7, wherein the processing unit further executes the computer usable program code to sort the records according to the relevancy score, wherein the relevancy 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.

9. The apparatus of claim 7, 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 the alphanumeric hash, wherein the set of inflected data fields are formed from a set of lightweight directory access protocol data fields.

10. 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 alphanumeric character of a search query comprising one or more alphanumeric characters from a set of alphanumeric characters comprising letters ranging from A-Z and numbers ranging from 0-9 into a respective corresponding phonetic variant in a one to one relationship to form an inflected search query in response to receiving a search query-using an alphanumeric phonetic hash that includes a mapping of the set of alphanumeric characters into a set of phonetic variants, wherein each phonetic variant is represented as a spelled out word that corresponds to a unique character in the set of alphanumeric characters, and wherein the inflected search query is a vector space having a set of vectors wherein each vector corresponds to a respective individual alphanumeric character of the 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, wherein an inflected data field is a vector space comprising a group of vectors;

calculates a relevancy score for the records of the set of records that satisfies the inflected search query, wherein the relevancy score is calculated as a percentage of vectors of an inflected data field that are in common with the vectors of the inflected search query;

determines whether the relevancy score meets a modifiable predetermined threshold;

calculates search parameters as a percentage of vectors of the inflected search query that are in common with the vectors of the inflected data field; and

responsive to the relevancy score meets the modifiable predetermined threshold generates a search result listing records of the set of records satisfying the search query and conforming to the searching parameters.

11. The system of claim 10, wherein the a vector space module sorts the records according to the relevancy score, wherein the relevancy 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.

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