# US 2010/0161661 A1 · Performing an ordered search of different databases

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0161661 A1
- Document ID: US20100161661A1
- Status: Published application
- Kind: A1
- Application number: 12/703,756
- Filed: 2010-02-10
- Published: 2010-06-24
- Earliest claimed: 2005-08-24
- Assignees: Yahoo! Inc.
- Inventors: Stephen Hood; Ralph Rabbat; Mihir Shah; Adam Durfee; Alastair Gourlay; Peter Anick; Richard Kasperski; Oliver Thomas Bayley; Ashley Woodman Hall; Shyam Kapur; John Thrall
- Web page: https://patentgrep.com/patent/US20100161661A1

## CPC

- G06F 16/3338: {Query expansion}
- G06F 16/00: Information retrieval; Database structures therefor; File system structures therefor
- G06F 16/332: Query formulation
- G06F 16/3322: {using system suggestions (G06F16/3325 takes precedence)}
- G06F 16/3329: Natural language query formulation
- G06F 16/3331: Query processing
- G06F 16/334: Query execution (filtering based on additional data G06F16/335)
- G06F 16/90324: {using system suggestions}
- G06F 16/9038: Presentation of query results
- G06F 16/951: Indexing; Web crawling techniques
- G06F 16/953: Querying, e.g. by the use of web search engines
- G06F 16/9566: {URL specific, e.g. using aliases, detecting broken or misspelled links}
- Y10S 707/99933: Query processing, i.e. searching
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS

## 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

### Claim 1

A computer-implemented method of providing search results, comprising the steps of:
receiving a search query from a client node;
in response to receiving the search query, 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 satisfy particular criteria;
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 satisfy the particular criteria, 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;
generating a search result that is based on at least of the first set of one or more search results or the second set of one or more search results;
providing said search result to said client node;
wherein the steps are performed on one or more computing devices.

### Claim 2 (depends on 1)

The method of claim 1, wherein:
determining whether the first set of one or more search results satisfy particular criteria includes determining whether the first set of one or more search results meet a relevance threshold; and
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.

### Claim 3 (depends on 1)

The method of 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.

### Claim 4 (depends on 3)

The method of claim 3, wherein said criterion comprises said not-yet-submitted search query comprising a complete word.

### Claim 5 (depends on 3)

The method of claim 3, wherein said criterion comprises determining whether said not-yet-submitted search query matches a phrase in a dictionary of pre-defined phrases.

### Claim 6 (depends on 3)

The method of claim 3, 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.

### Claim 7 (depends on 1)

The method of 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.

### Claim 8 (depends on 1)

The method of 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.

### Claim 9 (depends on 1)

The method of claim 1, wherein:
the search query is a not-yet-submitted search query;
the step of generating the search result comprises generating 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.

### Claim 10 (depends on 1)

The method of claim 1, wherein:
the search query is a not-yet-submitted search query;
the search result is a speculative search result;
generating the search result comprises generating 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.

### Claim 11 (depends on 1)

One or more storage media storing instructions which, when executed by one or more processors, causes the performance of the method recited in claim 1.

### Claim 12 (depends on 2)

One or more storage media storing instructions which, when executed by one or more processors, causes the performance of the method recited in claim 2.

### Claim 13 (depends on 3)

One or more storage media storing instructions which, when executed by one or more processors, causes the performance of the method recited in claim 3.

### Claim 14 (depends on 4)

One or more storage media storing instructions which, when executed by one or more processors, causes the performance of the method recited in claim 4.

### Claim 15 (depends on 5)

One or more storage media storing instructions which, when executed by one or more processors, causes the performance of the method recited in claim 5.

### Claim 16 (depends on 6)

One or more storage media storing instructions which, when executed by one or more processors, causes the performance of the method recited in claim 6.

### Claim 17 (depends on 7)

One or more storage media storing instructions which, when executed by one or more processors, causes the performance of the method recited in claim 7.

### Claim 18 (depends on 8)

One or more storage media storing instructions which, when executed by one or more processors, causes the performance of the method recited in claim 8.

### Claim 19 (depends on 9)

One or more storage media storing instructions which, when executed by one or more processors, causes the performance of the method recited in claim 9.

### Claim 20 (depends on 10)

One or more storage media storing instructions which, when executed by one or more processors, causes the performance of the method recited in claim 10.
