Ranking Algorithm for Search Queries

1. A method, comprising: selecting a plurality of equivalent keywords responsive to a search query; determining a rank of each of the plurality of equivalent keywords, the rank being based on parameters including a number of bids on items matching the search query and a number of items matching the search query being placed on a watch list; selecting a plurality of most highly ranked keywords from the plurality of equivalent keywords; and preparing a response to the search query including the plurality of most highly ranked keywords.

2. The method of claim 1 , further comprising transmitting the response.

3. The method of claim 2 , further comprising fitting the response within a single communications packet prior to transmitting the response.

4. The method of claim 1 , wherein the selecting the plurality of equivalent keywords is based on one or more characters within the search query.

5. The method of claim 4 , wherein the one or more characters are received within a single packet.

6. The method of claim 1 , further comprising basing the rank on a turnover rate of a listing to which the search query is directed.

7. The method of claim 1 , wherein the determining of the rank includes calculating a weight of each of the plurality of equivalent keywords.

8. The method of claim 1 , further comprising basing the weighting on at least one item in a group of parameters, the parameters consisting of most frequent queries, a number of items available matching the search query, the number of bids on items matching the search query, a number of purchases of items matching the search query, and the number of items matching the search query being placed on a watch list.

9. The method of claim 1 , further comprising selecting the plurality of equivalent keywords from a weighted database.

10. The method of claim 1 , wherein selecting the plurality of equivalent keywords responsive to the search query includes finding prefixes or infixes to match available keywords from one or more consecutive characters from the search query.

11. A method, comprising: receiving one or more characters from an end-user as a query; selecting a plurality of equivalent keywords responsive to the query, the plurality of equivalent keywords being selected based on a consideration of matching at least a portion of the one or more characters both as a prefix and an infix; evaluating each of the plurality of equivalent keywords based on a probability of matching the query of the end-user; determining a rank of each of the plurality of equivalent keywords, the rank being based on parameters including a number of bids on items matching the search query and a number of items matching the search query being placed on a watch list; selecting a plurality of most highly ranked keywords from the plurality of equivalent keywords; preparing a subset of the plurality of most highly ranked keywords based on the matching probability, the subset forming a response; and transmitting the response to the end-user.

12. The method of claim 11 , further comprising selecting the plurality of equivalent keywords from a weighted database.

13. The method of claim 12 , further comprising updating the weighted database based on a determination of a positive matching of at least one of the subset of the plurality of most highly ranked keywords.

14. The method of claim 13 , wherein the updating includes increasing a weighting factor for the at least one of the subset of the plurality of most highly ranked keywords.

15. The method of claim 11 , further comprising basing a rank of the plurality of most highly ranked keywords on a turnover rate of a listing to which the search query is directed.

16. The method of claim 15 , wherein the determining of the rank includes calculating a weight of each of the plurality of most highly ranked keywords.

17. A tangible machine-readable storage medium having no transitory signal components and storing instructions that, when executed by one or more processors, causes the one or more processors to perform operations, comprising: selecting a plurality of equivalent keywords responsive to a search query; determining a rank of each of the plurality of equivalent keywords, the rank being based on parameters including a number of bids on items matching the search query and a number of items matching the search query being placed on a watch list; selecting a plurality of most highly ranked keywords from the plurality of equivalent keywords; and preparing a response to the search query including the plurality of most highly ranked keywords.

18. The tangible machine-readable storage medium of claim 17 , wherein the determining of the rank includes calculating a weight of each of the plurality of equivalent keywords.

19. The tangible machine-readable storage medium of claim 18 , further comprising basing the weighting on at least one item in a group of parameters, the parameters consisting of most frequent queries, a number of items available matching the search query, the number of bids on items matching the search query, a number of purchases of items matching the search query, and the number of items matching the search query being placed on a watch list.