Universal query search results
Abstract
Generally described, embodiments of the present invention provide the ability to generate a universal query result set from several different search index result sets by including identifications of items from the different search index result sets in an accurate manner. After a query has been submitted, search index result sets are received from several different search indexes, an allocation score for each search index is computed and a universal item score for the top-level item identified in each search index is computed. The method then combines the allocation score and the universal item score for the top level item for each search index result set and adds the item with the highest combined score to the universal query result set.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1 . A computer-implemented method, comprising:
under control of one or more computer systems configured with executable instructions,
distributing a query to a plurality of search indexes, each search index corresponding to a category of items;
receiving a plurality of search index result sets;
determining probabilities of items in the plurality of search index result sets satisfying the query;
normalizing at least one of a plurality of distinct internal ranking scales associated with the plurality of search indexes to a common ranking scale; and
generating a universal query result set including at least a plurality of the items selected from the plurality of search index result sets in an order utilizing the common ranking scale based at least in part on the probabilities of the items satisfying the query.
2 . The computer-implemented method of claim 1 , wherein distributing the query to the plurality of search indexes includes:
providing a first copy of the query to a first search index and providing a second copy of the query to a second search index, wherein receiving the plurality of search index result sets comprises receiving a first search index result set ranked according to a first ranking scale and receiving a second search index result set ranked according to a second ranking scale.
3 . The computer-implemented method of claim 1 , further comprising:
identifying historical queries having at least one similar search parameter to the query, and wherein generating the universal query result set is based at least in part on recorded actions associated with the historical queries.
4 . The computer-implemented method of claim 3 , further comprising:
determining an appropriateness score of each search index for the query, each appropriateness score corresponding to an appropriateness of the category of items for the query; and applying a weight to the appropriateness score of each search index based at least in part on the recorded actions associated with the historical queries, wherein generating the universal query result set is based at least in part on the probabilities of the items satisfying the query, the appropriateness score of each search index for the query, and the weight applied to each appropriateness score.
5 . The computer-implemented method of claim 4 , wherein determining the appropriateness score comprises modifying each appropriateness score differently based at least in part on different types of recorded actions associated with the historical queries that were submitted to a corresponding search index.
6 . The computer-implemented method of claim 1 , wherein each of the plurality of search index result sets is ranked in accordance with a different internal relevance ranking function.
7 . The computer-implemented method of claim 6 , wherein each of the different internal relevance ranking functions rank items in accordance with one of the plurality of distinct internal ranking scales.
8 . A computer system, comprising:
a query controller configured to, at least:
receive a query from a searching entity;
distribute the query to a plurality of search indexes, each search index corresponding to a category of items;
receive a plurality of search index result sets;
determine probabilities of items in the plurality of search index result sets satisfying the query;
normalize at least one of a plurality of distinct internal ranking scales associated with the plurality of search indexes to a common ranking scale;
generate a universal query result set including at least a plurality of the items selected from the plurality of search index result sets in an order utilizing the common ranking scale based at least in part on the probabilities of the items satisfying the query; and
provide the universal query result set to the searching entity; and
one or more processors collectively configured to facilitate at least the query controller.
9 . The computer system of claim 8 , wherein the query is received from a computing device distinct from the computer system comprising the query controller.
10 . The computer system of claim 8 wherein the plurality of search indexes reside, at least in part, on at least one computing device distinct from the computer system comprising the query controller.
11 . The computer system of claim 8 wherein distributing the query to the plurality of search indexes includes:
providing a first copy of the query to a first search index and providing a second copy of the query to a second search index,
wherein receiving the plurality of search index result sets comprises receiving a first search index result set ranked according to a first ranking scale and receiving a second search index result set ranked according to a second ranking scale.
12 . The computer system of claim 8 , the query controller further configured to:
identify historical queries having at least one similar search parameter to the query, and wherein generating the universal query result set is based at least in part on recorded actions associated with the historical queries.
13 . The computer system of claim 12 , the query controller further configured to:
determine an appropriateness score of each search index for the query, each appropriateness score corresponding to an appropriateness of the category of items for the query; and apply a weight to the appropriateness score of each search index based at least in part on the recorded actions associated with the historical queries, wherein generating the universal query result set is based at least in part on the probabilities of the items satisfying the query, the appropriateness score of each search index for the query, and the weight applied to each appropriateness score.
14 . The computer system of claim 13 , wherein determining the appropriateness score comprises modifying each appropriateness score differently based at least in part on different types of recorded actions associated with the historical queries that were submitted to a corresponding search index.
15 . A non-transitory computer-readable storage medium storing instructions that, when executed by at least one processor, cause a computing device to:
distribute the query to a plurality of search indexes, each search index corresponding to a category of items; receive a plurality of search index result sets; determine probabilities of items in the plurality of search index result sets satisfying the query; normalize at least one of a plurality of distinct internal ranking scales associated with the plurality of search indexes to a common ranking scale; generate a universal query result set including at least a plurality of the items selected from the plurality of search index result sets in an order utilizing the common ranking scale based at least in part on the probabilities of the items satisfying the query.
16 . The non-transitory computer-readable storage medium of claim 15 , wherein distributing the query to the plurality of search indexes includes:
providing a first copy of the query to a first search index and providing a second copy of the query to a second search index, wherein receiving the plurality of search index result sets comprises receiving a first search index result set ranked according to a first ranking scale and receiving a second search index result set ranked according to a second ranking scale.
17 . The non-transitory computer-readable storage medium of claim 15 , the instructions further configured to cause the computing device to:
identify historical queries having at least one similar search parameter to the query, and wherein generating the universal query result set is based at least in part on recorded actions associated with the historical queries.
18 . The non-transitory computer-readable storage medium of claim 17 , the instructions further configured to cause the computing device to:
determine an appropriateness score of each search index for the query, each appropriateness score corresponding to an appropriateness of the category of items for the query; and apply a weight to the appropriateness score of each search index based at least in part on the recorded actions associated with the historical queries, wherein generating the universal query result set is based at least in part on the probabilities of the items satisfying the query, the appropriateness score of each search index for the query, and the weight applied to each appropriateness score.
19 . The non-transitory computer-readable storage medium of claim 18 , wherein determining the appropriateness score comprises modifying each appropriateness score differently based at least in part on different types of recorded actions associated with the historical queries that were submitted to a corresponding search index.
20 . The non-transitory computer-readable storage medium of claim 15 , wherein each of the plurality of search index result sets is ranked in accordance with a different internal relevance ranking function.Join the waitlist — get patent alerts
Track US2015347417A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.