Efficient evaluation of complex search queries

• US 20070033165A1
• Filed: 08/02/2005
• Published: 02/08/2007
• Est. Priority Date: 08/02/2005
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Sheinwald, Dafna, Sznajder, Benjamin
• Application Number:
  US11/195,128
• Publication Number:
  US 20070033165A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/3341 using boolean model

Abstract

A computer-implemented method, for searching a corpus of documents having an index, includes receiving a complex query, which includes a plurality of words conjoined by operators including a root operator and at least one intermediate operator. Respective advancement potentials are assigned to the words in the complex query. A query processor applies a consultation method to the words and operators in the complex query in order to choose one of the words responsively to the advancement potentials. The query processor advances through the index in order to find a document containing the chosen one of the words, and evaluates the document to determine whether the document satisfies the complex query.

Claims

1. A computer-implemented method for searching a corpus of documents having an index, the method comprising:

receiving a complex query, which comprises a plurality of words conjoined by operators comprising a root operator and at least one intermediate operator;

assigning respective advancement potentials to the words in the complex query;

applying a consultation method to the words and operators in the complex query in order to choose one of the words responsively to the advancement potentials;

advancing through the index in order to find a document containing the chosen one of the words; and

evaluating the document to determine whether the document satisfies the complex query.

2. The method according to claim 1, wherein receiving the complex query comprises parsing the query to define a tree having a root node corresponding to the root operator, at least one intermediate node corresponding to the at least one intermediate operator, and leaves corresponding to the plurality of words.

3. The method according to claim 2, wherein applying the consultation method comprises associating a respective consultation method with each of the nodes and leaves, and invoking the consultation method recursively over the nodes and leaves in the tree in order to choose one of the leaves.

4. The method according to claim 3, wherein each of the nodes has children in the tree, and wherein invoking the consultation method comprises determining a respective node status for each of the nodes responsively to a child status of the children of each of the nodes.

5. The method according to claim 1, wherein applying the consultation method comprises specifying a range in the index and determining, with respect to each of the operators, whether the query can be satisfied by a document in the range.

6. The method according to claim 5, wherein applying the consultation method comprises, upon determining that the query cannot be satisfied by any of the documents in the range, selecting a next possible document following the range from which to continue the search.

7. The method according to claim 5, wherein applying the consultation method comprises, upon determining that one or more documents within the range may satisfy the query, selecting the words to search in the range according to an order of the advancement potentials of the words.

8. Apparatus for searching a corpus of documents, comprising:

a memory, which is arranged to store an index to the corpus; and

a query process, which is arranged to receive a complex query, which comprises a plurality of words conjoined by operators comprising a root operator and at least one intermediate operator, and to associate respective advancement potentials with the words in the complex query, and which is arranged to apply a consultation method to the words and operators in the complex query in order to choose one of the words responsively to the advancement potentials, to advance through the index in order to find a document containing the chosen one of the words, and to evaluate the document to determine whether the document satisfies the complex query.

9. The apparatus according to claim 8, wherein the query processor is arranged to parse the query to define a tree having a root node corresponding to the root operator, at least one intermediate node corresponding to the at least one intermediate operator, and leaves corresponding to the plurality of words.

10. The apparatus according to claim 9, wherein a respective consultation method is associated with each of the nodes and leaves, and wherein the query processor is arranged to invoke the consultation method recursively over the nodes and leaves in the tree in order to choose one of the leaves.

11. The apparatus according to claim 10, wherein each of the nodes has children in the tree, and wherein the query processor is arranged to determine a respective node status for each of the nodes responsively to a child status of the children of each of the nodes.

12. The apparatus according to claim 8, wherein the query processor is arranged to specify a range in the index and to determine, with respect to each of the operators, whether the query can be satisfied by a document in the range.

13. The apparatus according to claim 12, wherein the query processor is arranged, upon determining that the query cannot be satisfied by any of the documents in the range, to select a next possible document following the range from which to continue the search.

14. The apparatus according to claim 12, wherein the query processor is arranged, upon determining that one or more documents within the range may satisfy the query, to select the words to search in the range according to an order of the advancement potentials of the words.

15. A computer software product for searching a corpus of documents having an index, the product comprising a computer-readable medium in which program instructions are stored, which instructions, when read by a computer, cause the computer to accept a complex query, which comprises a plurality of words conjoined by operators comprising a root operator and at least one intermediate operator, and to associate respective advancement potentials with the words in the complex query, and cause the computer to apply a consultation method to the words and operators in the complex query in order to choose one of the words responsively to the advancement potentials, to advance through the index in order to find a document containing the chosen one of the words, and to evaluate the document to determine whether the document satisfies the complex query.

16. The product according to claim 15, wherein the instructions cause the computer to parse the query to define a tree having a root node corresponding to the root operator, at least one intermediate node corresponding to the at least one intermediate operator, and leaves corresponding to the plurality of words.

17. The product according to claim 16, wherein a respective consultation method is associated with each of the nodes and leaves, and wherein the instructions cause the computer to invoke the consultation method recursively over the nodes and leaves in the tree in order to choose one of the leaves.

18. The product according to claim 15, wherein the instructions cause the computer to specify a range in the index and to determine, with respect to each of the operators, whether the query can be satisfied by a document in the range.

19. The product according to claim 18, wherein the instructions cause the computer, upon determining that the query cannot be satisfied by any of the documents in the range, to select a next possible document following the range from which to continue the search.

20. The product according to claim 18, wherein the instructions cause the computer, upon determining that one or more documents within the range may satisfy the query, to select the words to search in the range according to an order of the advancement potentials of the words.