# US 2010/0169341 A1 · Predictive algorithm for search box auto-complete

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

- Number: US 2010/0169341 A1
- Document ID: US20100169341A1
- Status: Published application
- Kind: A1
- Application number: 12/346,720
- Filed: 2008-12-30
- Published: 2010-07-01
- Earliest claimed: 2008-12-30
- Assignees: eBay Inc.
- Inventors: Wenyan Hu; Xiaodi Zhang; Alvaro Bolivar; Randall Scott Shoup
- Web page: https://patentgrep.com/patent/US20100169341A1

## CPC

- G06F 16/3322: {using system suggestions (G06F16/3325 takes precedence)}
- G06F 16/90324: {using system suggestions}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In various exemplary embodiments, a system and associated method to predict search results in an electronic environment is disclosed. The system architecture comprises a communications module to receive a query from a remote end-user where the query includes one or more characters contained within a first single communications packet. A query engine is coupled to the communications module. The query engine uses the one or more characters from the query to predictively match keywords contained within a data structure (e.g., a database) and forms a response from the one or more characters. The response is transmitted back to the end-user within a second single TCP communications packet.

## Claims

### Claim 1

A system to predict search results in an electronic environment, the system comprising:
a communications module to receive a query, the query including one or more characters;
a query engine coupled to the communications module, the query engine to use the one or more characters from the query to predictively match keywords contained within a data structure and to form a response based on the matched keywords, the response to be transmitted within a second single communications packet.

### Claim 2 (depends on 1)

The system of claim 1 further comprising the query engine to predictively match the keywords from the one or more characters based on a subset of most popular queries from within the data structure.

### Claim 3 (depends on 1)

The system of claim 1 further comprising the query engine to generate a plurality of responses to the query based on the one or more characters.

### Claim 4 (depends on 3)

The system of claim 3 further comprising the communications module to return the plurality of responses to a generator of the query.

### Claim 5 (depends on 4)

The system of claim 4, wherein the plurality of responses is contained within the second single communications packet.

### Claim 6 (depends on 3)

The system of claim 3 further comprising the communications module to send a plurality of sub-nodes along with the plurality of responses to a generator of the query, each of the plurality of sub-nodes including an additional plurality of responses relating to the one or more characters.

### Claim 7 (depends on 6)

The system of claim 6, wherein the additional plurality of responses is contained within the second single communications packet.

### Claim 8 (depends on 1)

The system of claim 1 further comprising the query engine to predictively match the keywords based on the one or more characters from the query as either a prefix or an infix.

### Claim 9

A method to provide a plurality of responses to a search request, the method comprising:
receiving, in a first single communications packet, one or more characters from the search request;
predicting a plurality of keywords based on the one or more characters;
identifying the plurality of responses based on the plurality of keywords;
fitting the plurality of responses within a second single communications packet; and
returning the plurality of responses concurrently in response to the search request.

### Claim 10 (depends on 9)

The method of claim 9, wherein the returning the plurality of responses includes sending a plurality of sub-nodes, each of the plurality of sub-nodes including an additional plurality of responses.

### Claim 11 (depends on 9)

The method of claim 9 further comprising basing the predicting the plurality of keywords on selecting the plurality of keywords as a set of equivalent keywords for the one or more characters.

### Claim 12 (depends on 9)

The method of claim 9 further comprising selecting a plurality of equivalent keywords, including:
finding prefixes or infixes matching each of the plurality of equivalent keywords; and
selecting the most probable keywords from the plurality of equivalent keywords.

### Claim 13 (depends on 9)

The method of claim 9 further comprising predictively matching each of the plurality of keywords from the one or more characters based on a subset of most popular queries from within a database.

### Claim 14 (depends on 9)

The method of claim 9 further comprising generating the plurality of responses based on the one or more characters.

### Claim 15 (depends on 9)

The method of claim 9 further comprising sending a plurality of sub-nodes along with the plurality of responses in the second single communications packet, each of the plurality of sub-nodes including an additional plurality of responses.

### Claim 16 (depends on 9)

The method of claim 9 further comprising predictively matching keywords based on the one or more characters as either a prefix or an infix of each of the plurality of keywords.

### Claim 17

A machine-readable storage medium storing an instruction that, when executed by a processor, causes the processor to perform a method to provide a plurality of responses to a search request from an end-user, the method comprising:
receiving, in a first single communications packet, one or more characters from the search request;
predicting a plurality of keywords based on the one or more characters;
fitting the plurality of responses within a second single communications packet; and
returning the plurality of responses concurrently to the end-user.

### Claim 18 (depends on 17)

The machine-readable storage medium of claim 17 wherein the method further comprises sending a plurality of sub-nodes, each of the plurality of sub-nodes including an additional plurality of responses.

### Claim 19 (depends on 17)

The machine-readable storage medium of claim 17 wherein the method further comprises basing the predicting of the plurality of keywords on selecting the plurality of keywords as a set of equivalent keywords for the one or more characters.

### Claim 20 (depends on 17)

The machine-readable storage medium of claim 17 wherein the method further comprises selecting a plurality of equivalent keywords, including:
finding prefixes or infixes matching the plurality of equivalent keywords; and
selecting the most probable keywords from the plurality of equivalent keywords.

### Claim 21 (depends on 17)

The machine-readable storage medium of claim 17 wherein the method further comprises predictively matching each of the plurality of keywords from the one or more characters based on a subset of most popular queries from within a data structure.

### Claim 22 (depends on 17)

The machine-readable storage medium of claim 17 wherein the method further comprises generating the plurality of responses based on the one or more characters.

### Claim 23 (depends on 17)

The machine-readable storage medium of claim 17 wherein the method further comprises sending a plurality of sub-nodes along with the plurality of responses in the second single communications packet, each of the plurality of sub-nodes including an additional plurality of responses.

### Claim 24 (depends on 17)

The machine-readable storage medium of claim 17 wherein the method further comprises predictively matching each of the plurality of keywords based on the one or more characters as either a prefix or an infix of each of the plurality of keywords.

### Claim 25

A system for predicting search results in an electronic environment, the system comprising:
a communications module to receiving a query, the query including one or more characters contained within a first single communications packet; and
a searching means for using the one or more characters from the query to predictively match keywords contained within a data structure, the searching means further for forming a response from the one or more characters to be transmitted within a second single communications packet.

### Claim 26 (depends on 25)

The system of claim 25, wherein the searching means further predictively matches the keywords from the one or more characters based on a subset of most popular queries from within the data structure.

### Claim 27 (depends on 25)

The system of claim 25, wherein the searching means further generates a plurality of responses to the query based on the one or more characters.

### Claim 28 (depends on 27)

The system of claim 27, wherein the communications module is further to return the plurality of responses to a generator of the query in the second single communications packet.

### Claim 29 (depends on 27)

The system of claim 27, wherein the communications module is further to send a plurality of sub-nodes along with the plurality of responses to a generator of the query in the second single communications packet, each of the plurality of sub-nodes includes an additional plurality of responses responsive to the one or more characters.

### Claim 30 (depends on 25)

The system of claim 25, wherein the searching means further predictively matches the keywords based on the one or more characters from the query as either a prefix or an infix.
