Speculative search result based on a not-yet-submitted search query

• US 7,672,932 B2
• Filed: 08/24/2005
• Issued: 03/02/2010
• Est. Priority Date: 08/24/2005
• Status: Active Grant

• Current Assignee: Jollify Management Limited
• Original Assignee: Yahoo! Inc. (Apollo Global Management, Inc.)
• Inventors: Kasperski, Richard, Kapur, Shyam, Thrall, John, Anick, Peter, Shah, Mihir, Gourlay, Alastair, Bayley, Oliver Thomas, Hood, Stephen, Durfee, Adam, Rabbat, Ralph, Hall, Ashley Woodman
• Primary Examiner(s): CHANNAVAJJALA, SRIRAMA T
• Application Number:
  US11/212,044
• Publication Number:
  US 20070055652A1
• Time in Patent Office: 1,651 Days
• Field of Search: 707/1, 707 3- 6, 707/10, 707/102, 707/104.1, 707/200, 707/7, 707/100, 709220-225, 706 45- 50
• US Class Current: 1/1
• CPC Class Codes: G06F 16/00 Information retrieval; Database structures therefor; File system structures therefor
• CPC Class Codes: G06F 16/332 Query formulation
• CPC Class Codes: G06F 16/3322 using system suggestions G06F16/3325 takes precedence
• CPC Class Codes: G06F 16/3329 Natural language query formulation or dialogue systems
• CPC Class Codes: G06F 16/3331 Query processing
• CPC Class Codes: G06F 16/3338 Query expansion
• CPC Class Codes: G06F 16/334 Query execution G06F16/335 takes precedence
• CPC Class Codes: G06F 16/90324 using system suggestions
• CPC Class Codes: G06F 16/9038 Presentation of query results
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 16/9566 URL specific, e.g. using aliases, detecting broken or misspelled links
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching

Abstract

Providing a speculative search result for a search query prior to completion of the search query. In response to receiving a search query from a client node, a speculative search result is provided to the client node for the search query prior to receiving an indication from the client node that said search query is completely formed. The speculative search result may be displayed on the same web page on the client node as the search query, while the search query is being entered by the user. As the user further enters the search query, a new speculative search result may be provided to the user.

Claims

1. A computer-implemented method of providing speculative search results, comprising the steps of:

receiving a search query from a client node;

determining a search result for said search query;

wherein determining the search result comprises performing an ordered search of different databases;

wherein performing the ordered search of different databases comprises;

performing, based on the search query, a first search that produces a first set of one or more search results, wherein performing the first search comprises searching a first set of one or more databases;

determining whether the first set of one or more search results meet a relevance threshold, wherein the step of determining is based on relevance scores, assigned to documents in the first set of one or more search results, that reflect relevance between the first set of one or more search results and the search query;

performing, based on the search query, a second search that produces a second set of one or more search results if and only if the first set of one or more search results do not meet the relevance threshold, wherein performing the second search comprises searching a second set of one or more databases, wherein the first set of one or more databases is different than the second set of one or more databases;

determining whether the second set of search results meet the relevance threshold, wherein the step of determining whether the second set of search results meet the relevance threshold is based on relevance scores, assigned to documents in the second set of one or more search results, that reflect relevance between the second set of one or more search results and the search query;

in response to determining that the second set of one or more search results meet the relevance threshold, (a) generating the search result from the second set of one or more search results, and (b) providing said search result to said client node, wherein said search result identifies at least one item that satisfies said search query;

wherein the steps are performed on one or more computing devices.

2. A method as recited in claim 1, wherein:

the search query is a not-yet-submitted search query;

the step of determining the search result comprises determining a speculative search result based on the not-yet-submitted search query; and

the method further comprising

determining whether said not-yet-submitted search query meets a criterion for initiating said determining the speculative search result, and

performing said determining the speculative search result in response to determining that said not-yet-submitted search query meets the criterion.

3. A method as recited in claim 2, wherein said criterion comprises said not-yet-submitted search query comprising a complete word.

4. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 3.

5. A method as recited in claim 2, wherein said criterion comprises determining whether said not-yet-submitted search query matches a phrase in a dictionary of pre-defined phrases.

6. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 5.

7. A method as recited in claim 2, wherein said criterion comprises determining that a pre-determined period of time has passed since a character was last entered in said not-yet-submitted search query.

8. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 7.

9. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 2.

10. A method as recited in claim 1, wherein said databases comprise a database of pre-defined search results each comprising an organized collection of information related to a search query.

11. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 10.

12. A method as recited in claim 1, wherein said determining the search result comprises determining a navigational link related to said search query.

13. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 12.

14. A method as recited in claim 1, wherein:

the search query is a not-yet-submitted search query;

the step of determining the search result comprises determining a speculative search result based on the not-yet-submitted search query; and

the method further comprising;

receiving a further portion of said not-yet-submitted search query from said client node;

determining an updated speculative search result for said further portion prior to receiving an indication from said client node that said not-yet-submitted search query is completely formed; and

providing said updated speculative search result to said client node, wherein said updated speculative search result identifies at least one item that satisfies said not-yet submitted search query.

15. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 14.

16. A method as recited in claim 1, wherein:

the search query is not-yet-submitted;

the step of determining the search result comprises determining a speculative search result based on the not-yet-submitted search query; and

the method further comprising providing a suggestion to said client node to improve said not-yet submitted search query prior to receiving an indication from said client node that said search query is completely formed.

17. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 16.

18. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 1.

19. The method of claim 1, wherein:

the search query is not-yet-submitted;

the search result is a speculative search result;

determining the search result comprises determining the speculative search result for the not-yet-submitted search query prior to receiving an indication from said client node that said not-yet-submitted search query is completely formed;

the first set of one or more search results is a first set of one or more speculative search results;

the second set of one or more search results is a second set of one or more speculative search results;

the method further comprising;

receiving input that indicates that said search query is submitted, and

performing a search based on said submitted search query.

20. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 19.

21. A computer-implemented method of providing speculative search results, comprising the steps of:

receiving a search query from a client node, wherein said search query is not-yet-submitted;

as characters are added or removed from said not-yet-submitted search query,

determining whether said not-yet-submitted search query matches at least one phrase in a collection of pre-defined phrases;

as long as said not-yet-submitted search query does not match at least one phrase in the collection of pre-defined phrases, then not determining a speculative search result;

only when said not-yet-submitted search query matches at least one phrase in the collection of pre-defined phrases, then performing;

determining a speculative search result for said not-yet-submitted search query prior to receiving an indication from said client node that said not-yet-submitted search query is completely formed, and

providing said speculative search result to said client node, wherein said speculative search result identifies at least one item that satisfies said not-yet submitted search query;

receiving input that indicates that said search query is submitted; and

performing a search based on said submitted search query;

wherein the steps are performed on one or more computing devices.

22. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 21.

23. A method as recited in claim 21, wherein the collection of pre-defined phrases is based on popular queries that have been previously submitted.

24. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 23.