System and method of generating string-based search expressions using templates

• US 7,505,985 B2
• Filed: 02/25/2005
• Issued: 03/17/2009
• Est. Priority Date: 02/25/2005
• Status: Expired due to Fees

• Current Assignee: AirBNB Incorporated
• Original Assignee: International Business Machines Corporation
• Inventors: Kilroy, John F.
• Primary Examiner(s): Pardo; Thuy N
• Application Number:
  US11/065,968
• Publication Number:
  US 20060195421A1
• Time in Patent Office: 1,481 Days
• Field of Search: 707/2, 707/3, 707/101, 707/102, 707/103.R, 707/104.1, 707/9, 707/4, 707/103.Y, 708/110, 726/1, 709/223
• US Class Current: 1/1
• CPC Class Codes: G06F 16/242 Query formulation
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99944 Object-oriented database structure
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing

Abstract

Described are a system and method for generating a search expression for use in searching heterogeneous repositories. An application program receives user-supplied input. A template is selected based on a structure of the input. The input is scanned and tokenized. Each token is substituted into one or more locations within the template designated for that token to produce a string-based search expression. The search expression can have logical OR and logical AND operations, parentheses to specify precedence of evaluation, and an infix notation. Templates are modifiable for changing the content of search expressions constructed for a given user input. User-specifiable and user-modifiable aspects include the selecting of particular attributes, operators, and evaluation precedence of template expressions, the tokenizing of user input, the mapping of token sequences to particular templates, and the designation of locations within a selected token expression in which to substitute tokens derived from the user input.

Claims

1. A computer-implemented method for generating a search expression for use in searching heterogeneous repositories, the method comprising:

providing in computer memory of a computer a plurality of user-modifiable templates, each template being defined according to a different lexical structure and being associated with a user-modifiable, repository neutral template expression;

parsing user-supplied input received by the computer from a user-input device to produce one or more tokens therefrom and to identify a lexical structure of the user-supplied input;

selecting from the plurality of user-modifiable templates stored in computer memory a template with a lexical structure that matches the identified lexical structure of the user-supplied input; and

inserting each token produced from the user-supplied input into a designated location in the user-modifiable, repository neutral template expression of the selected template to produce a string-based, repository neutral search expression to be used in a computerized search of the heterogeneous repositories.

2. The method of claim 1, wherein the string-based search expression can include logical OR and logical AND Boolean operators.

3. The method of claim 1, wherein the string-based search expression can include parenthetical expressions to indicate precedence of operation.

4. The method of claim 1, wherein the string-based search expression has an infix notation.

5. The method of claim 1, further comprising specifying, by a user, how to tokenize the user-supplied input.

6. The method of claim 5, wherein the step of specifying includes defining one or more special delimiters that can appear in the user-supplied input.

7. The method of claim 1, further comprising specifying, by a user, a mapping of particular token sequences to particular templates.

8. The method of claim 1, further comprising specifying, by a user, a manner in which each token that is derived from the user-supplied input is applied to a template expression of the selected template.

9. The method of claim 1, further comprising specifying, by a user, at least one of a particular attribute, operator, and evaluation precedence in the template expression of the selected template.

10. The method of claim 1, wherein the string-based search expression is a GQL (Generic Query Language) expression.

11. The method of claim 1, wherein the plurality of templates includes a default template for use when the lexical structure of the user-supplied input does not match the lexical structure of any of the templates.

12. The method of claim 1, further comprising embedding the string-based, repository neutral search expression within a query expression.

13. The method of claim 12, further comprising forwarding the query expression with the embedded string-based, repository neutral search expression to a handler that converts the query expression into one or more repository-specific query expressions.