Collaborative search of databases
US-2017255631-A1 · Sep 7, 2017 · US
US11526522B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11526522-B2 |
| Application number | US-201916691644-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 22, 2019 |
| Priority date | Dec 21, 2015 |
| Publication date | Dec 13, 2022 |
| Grant date | Dec 13, 2022 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A search query is received from a search engine of multiple search engines. One or more search results from each search engine of the multiple search engines in response to the search query are received. Each search result of the one or more search results includes a first search score. A factor is determined for each search result of the one or more search results. A second search score is determined for each search result of the one or more search results based on the first search score and the factor. The one or more search results are displayed to a user of the search engine in an order. The order is based on the second search score.
Opening claim text (preview).
What is claimed is: 1. A computer-implemented method performed at one or more computer processors, comprising: receiving a plurality of search results, comprising: a first set of search results from a first search engine searching a first shared repository; and a second set of search results from a second search engine searching a second shared repository; assigning a first search score to each search result of the plurality of search results based on a match between a search query and each search result; determining a factor for each search result of the second set of search results; updating the factor for each search result of the second set of search results by: determining whether each search result of the second set of search results is selected by the user; responsive to determining that a search result of the second set of search results is selected by the user, increasing, by one or more computer processors, the factor proportionally to an order in which the search result is displayed; and responsive to determining that a search result from the second set of search results is not selected by the user, decreasing, by one or more computer processors, the factor inversely proportionally to the order in which the search result is displayed; determining a second search score for each of the second set of search results, wherein: the second search score comprises the first search score associated with each search result multiplied by the factor associated with each search result; and returning the plurality of search results through the cross-search engine according to a rank based on the first search score and the second search score. 2. The method of claim 1 , wherein updating the factor for each search result of the second set of search results comprises: decreasing, by one or more computer processors, the factor by a value to reduce influence of past data on the factor, wherein the value is a same value for each factor of each search result of the second set of search results. 3. The method of claim 1 , wherein the first search engine and the second search engine correspond to an information source containing frequently asked questions and answers. 4. The method of claim 1 , wherein: the factor is inversely proportional to a number of times each search result of the second set of search results from the second shared repository is displayed to the user in response to the search query, and the factor is proportional to a number of times each search result of the second set of search results from the second shared repository is selected by the user. 5. The method of claim 1 , further comprising: directing the first search engine to perform a first search of the search query in the first shared repository; directing the second search engine to perform a second search of the search query in the second shared repository. 6. A computer program product comprising: one or more computer readable storage media; and program instructions stored on the one or more computer readable storage media, the program instructions comprising: program instructions to receive a plurality of search results at a cross-search engine, comprising: a first set of search results from a first search engine searching a first shared repository; and a second set of search results from a second search engine searching a second shared repository; program instructions to assign a first search score to each search result of the plurality of search results based on a match between a search query submitted to the first search engine and each search result; program instructions to determine a factor for each search result of the second set of search results; program instructions to update the factor for each search result of the second set of search results using: program instructions to determine whether each search result of the second set of search results is selected by the user; program instructions, responsive to determining that a search result of the second set of search results is selected by the user, to increase the factor proportionally to an order in which the search result is displayed; and program instructions, responsive to determining that a search result of second set of search results is not selected by the user, to decrease the factor inversely proportionally to the order in which the search result is displayed; program instructions to determine a second search score for each of the second set of search results, wherein: the second search score comprises the first search score associated with each search result multiplied by the factor associated with each search result; and program instructions to return the plurality of search results through the cross-search engine according to a rank based on the first search score and the second search score. 7. The computer program product of claim 6 , wherein the program instructions to update the factor for each search result of the second set of search results comprise: program instructions to decrease the factor by a value to reduce influence of past data on the factor, wherein the value is a same value for each factor of each search result of the second set of search results. 8. The computer program product of claim 6 , wherein the first search engine and the second search engine correspond to an information source containing frequently asked questions and answers. 9. The computer program product of claim 6 , wherein: the factor is inversely proportional to a number of times each search result of the second set of search results from the second shared repository is displayed to the user in response to the search query, and the factor is proportional to a number of times each search result of the second set of search results from the second shared repository is selected by the user. 10. The computer program product of claim 6 , further comprising program instructions, stored on the one or more computer readable storage media, to: direct the first search engine to perform a first search of the search query in the first shared repository; direct the second search engine to perform a second search of the search query in a second shared repository. 11. A computer system comprising: one or more computer processors; one or more computer readable storage media; and program instructions, stored on the one or more computer readable storage media, for execution by at least one of the one or more computer processors, the program instructions comprising: program instructions to receive a plurality of search results at a cross-search engine, comprising a first set of search results from a first search engine searching a first shared repository; and a second set of search results from a second search engine searching a second shared repository; program instructions to assign a first search score to each search result of the plurality of search results based on a match between a search query submitted to the first search engine and each search result; program instructions to determine a factor for each search result of the second set of search results; program instructions to update the factor for each search result of the second set of search results using: program instructions to determine whether each search result of the second set of search results is selected by the user; program instructions, responsive to determining that a search result of the second set of search results is selected by the user, to increase the factor proportionally to an order in which the search result is displayed; and program instructions, responsive to determining that a search result of second set of search results is not sele
Presentation of query results · CPC title
using ranking · CPC title
Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor · CPC title
Indexing; Web crawling techniques · CPC title
Presentation of query results · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.