Patent US6795115B1 successfully refreshed from Google Patents.
Patent US6728704B2 successfully refreshed from Google Patents.
US6728704B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for merging result lists from multiple search engines
Assignee: Valtrus Innovations Ltd
•
Filing: 2001-08-27
•
Granted: 2004-04-27
•
Expires: 2021-08-27
Abstract
Abstract This invention includes the step of transmitting a query to a set of search engines. Any result lists returned from these search engines is received, and a subset of entries in each result list is selected. Each entry in this subset is assigned a scoring value according to a scoring function, and each result list is then assigned a representative value according to the scoring values assigned to its entries. A merged list of entries is produced based upon the representative value assigned to each result list.
Inventors
- 👤 Jianchang Mao
- 👤 Rajat Mukherjee
- 👤 Prabhakar Raghavan
- 👤 Panayiotis Tsaparas
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 12:08
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/95; G06F16/953; G06F16/9538; G06F16/951; G06F16/9532; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933
Claims Analysis
Total Claims: 27
Claim 1
Independent Claim
131 words
A method of merging result lists from multiple search engines, said method comprising: transmitting a query to a set of search engines; receiving in response to said query a result list from each search engine of said set of search engines, each result list including one or more entries; selecting a subset of entries from each result list to form a set of selected entries; assigning to each selected entry of said set of selected entries a scoring value according to a scoring function; assigning to each subset a representative value according to the scoring values assigned to its entries; and producing a merged list of entries in a predetermined manner based on the representative value assigned to each result list, wherein the representative value varies in accordance with predetermined manner.
Claim 2
Independent Claim
131 words
A method of merging result lists from multiple search engines, said method comprising: transmitting a query to a set of search engines; receiving in response to said query a result list from each search engine of said set of search engines, each result list including one or more entries; selecting a subset of entries from each result list to form a set of selected entries; assigning to each selected entry of said set of selected entries a scoring value according to a scoring function; assigning to each subset a representative value according to the scoring values assigned to its entries; and producing a merged list of entries in a predetermined manner based on the representative value assigned to each result list, wherein the representative value varies in accordance with predetermined manner.
Claim 3
Dependent Claim
27 words
The method of claim 1 wherein said selecting includes selecting a consecutive number of entries from each result list, including the first entry from each result list.
Claim 4
Dependent Claim
23 words
The method of claim 1 wherein said selecting includes selecting a uniform number of entries that are uniformly spaced within each result list.
Claim 5
Dependent Claim
21 words
The method of claim 1 wherein said selecting includes selecting a uniform number of entries at random from each result list.
Claim 6
Dependent Claim
74 words
The method of claim 1 wherein said producing includes (A) selecting the result list having the highest average value so as to form a selected list, (B) selecting from said selected list the first entry that has not already been selected for ranking, (C) decrementing the average value of said result list by a specified number, and repeating (A), (B) and (C) in order until every entry in every result list has been selected.
Claim 7
Dependent Claim
76 words
The method of claim 1 wherein said producing includes (A) assigning to each result list a probability value based on its avenge value, (B) selecting a result list preferentially based on its probability value so as to form a selected list, (C) selecting from said selected list the first entry that has not already been selected for ranking, and repeating (A), (B) and (C) in order until every entry in every result list has been selected.
Claim 8
Dependent Claim
207 words
A computer-readable memory to instruct a computer to function in a specified manner, comprising: executable instructions stored in said memory, said executable instructions including: instructions for forming a set of selected entries by selecting a subset of entries from each result list of a set of result lists, wherein each result list in said set of result lists has been generated in response to a query processed by a search engine; instructions for assigning each entry of said set of selected entries a scoring value according to a scoring function; instructions for assigning each result list in said set of result lists a representative value based on the scoring values assigned to its entries; and instructions for ranking every entry based on the representative value assigned to its result list, wherein said instructions for ranking include instructions for (A) assigning to each result list a probability value that is based on its average value, (B) selecting a result list preferentially based on its probability value so as to form a selected list, (C) selecting from said selected list the first entry that has not already been selected for ranking, and repeating (A), (B) and (C) in order until every entry in every result list has been selected.
Claim 9
Dependent Claim
207 words
A computer-readable memory to instruct a computer to function in a specified manner, comprising: executable instructions stored in said memory, said executable instructions including: instructions for forming a set of selected entries by selecting a subset of entries from each result list of a set of result lists, wherein each result list in said set of result lists has been generated in response to a query processed by a search engine; instructions for assigning each entry of said set of selected entries a scoring value according to a scoring function; instructions for assigning each result list in said set of result lists a representative value based on the scoring values assigned to its entries; and instructions for ranking every entry based on the representative value assigned to its result list, wherein said instructions for ranking include instructions for (A) assigning to each result list a probability value that is based on its average value, (B) selecting a result list preferentially based on its probability value so as to form a selected list, (C) selecting from said selected list the first entry that has not already been selected for ranking, and repeating (A), (B) and (C) in order until every entry in every result list has been selected.
Claim 10
Dependent Claim
32 words
The computer-readable memory of claim 7 wherein said instructions for forming include instructions to select a consecutive number of entries from each result list, including the first entry from each result list.
Claim 11
Dependent Claim
28 words
The computer-readable memory of claim 7 wherein said instructions for forming include instructions to select a uniform number of entries that are uniformly spaced within each result list.
Claim 12
Dependent Claim
26 words
The computer-readable memory of claim 7 wherein said instructions for forming include instructions to select a uniform number of entries at random from each result list.
Claim 13
Dependent Claim
79 words
The computer-readable memory of claim 7 wherein said instructions for ranking include instructions for (A) selecting the result list having the highest average value so as to form a selected list, (B) selecting from said selected list the first entry that has not already been selected for ranking, (C) decrementing the average value of said result list by a specified number, and repeating (A), (B) and (C) in order until every entry in every result list has been selected.
Claim 14
Independent Claim
104 words
A method of merging result lists from multiple search engines, said method comprising: transmitting a query to a set of search engines; receiving in response to said query a set of result lists, each result list in said set of result lists including one or more entries; selecting a subset of entries from each result list; determining a scoring value for each entry of said subset of entries; characterizing said subset in accordance with a representative value; and merging entries in a predetermined manner into a single list based on said representative value, wherein said representative value varies in accordance with said predetermined manner.
Claim 15
Independent Claim
104 words
A method of merging result lists from multiple search engines, said method comprising: transmitting a query to a set of search engines; receiving in response to said query a set of result lists, each result list in said set of result lists including one or more entries; selecting a subset of entries from each result list; determining a scoring value for each entry of said subset of entries; characterizing said subset in accordance with a representative value; and merging entries in a predetermined manner into a single list based on said representative value, wherein said representative value varies in accordance with said predetermined manner.
Claim 16
Dependent Claim
27 words
The method of claim 12 wherein said selecting includes selecting a consecutive number of entries from each result list, including the first entry from each result list.
Claim 17
Dependent Claim
23 words
The method of claim 12 wherein said selecting includes selecting a uniform number of entries that are uniformly spaced within each result list.
Claim 18
Dependent Claim
21 words
The method of claim 12 wherein said selecting includes selecting a uniform number of entries at random from each result list.
Claim 19
Dependent Claim
74 words
The method of claim 12 wherein said merging includes (A) selecting the result list having the highest average value so as to form a selected list, (B) selecting from said selected list the first entry that has not already been selected for ranking, (C) decrementing the average value of said result list by a specified number, and repeating (A), (B) and (C) in order until every entry in every result list has been selected.
Claim 20
Dependent Claim
76 words
The method of claim 12 wherein said merging includes (A) assigning to each result list a probability value based on its average value, (B) selecting a result list preferentially based on its probability value so as to form a selected list, (C) selecting from said selected list the first entry that has not already been selected for ranking, and repeating (A), (B) and (C) in order until every entry in every result list has been selected.
Claim 21
Dependent Claim
127 words
A computer-readable memory to instruct a computer to function in a specified manner, comprising: executable instructions stored in said memory, said executable instructions including: instructions for transmitting a query to a set of search engines; instructions for receiving in response to said query a set of result lists, each result list in said set of result lists including one or more entries; instructions for selecting a subset of entries from each result list; instructions for determining a scoring value for each entry of said subset of entries; instructions for characterizing said subset in accordance with a representative value; and instructions for merging entries in a predetermined manner into a single list based on said representative value, wherein said representative value varies in accordance with said predetermined manner.
Claim 22
Dependent Claim
127 words
A computer-readable memory to instruct a computer to function in a specified manner, comprising: executable instructions stored in said memory, said executable instructions including: instructions for transmitting a query to a set of search engines; instructions for receiving in response to said query a set of result lists, each result list in said set of result lists including one or more entries; instructions for selecting a subset of entries from each result list; instructions for determining a scoring value for each entry of said subset of entries; instructions for characterizing said subset in accordance with a representative value; and instructions for merging entries in a predetermined manner into a single list based on said representative value, wherein said representative value varies in accordance with said predetermined manner.
Claim 23
Dependent Claim
32 words
The computer-readable memory of claim 18 wherein said instructions for selecting include instructions to select a consecutive number of entries in each result list, including the first entry from each result list.
Claim 24
Dependent Claim
28 words
The computer-readable memory of claim 18 wherein said instructions for selecting include instructions to select a uniform number of entries that are uniformly spaced within each result list.
Claim 25
Dependent Claim
26 words
The computer-readable memory of claim 18 wherein said instructions for selecting include instructions to select a uniform number of entries at random from each result list.
Claim 26
Dependent Claim
79 words
The computer-readable memory of claim 18 wherein said instructions for merging include instructions for (A) selecting the result list having the highest average value so as to form a selected list, (B) selecting from said selected list the first entry that has not already been selected for ranking, (C) decrementing the average value of said result list by a specified number, and repeating (A), (B) and (C) in order until every entry in every result list has been selected.
Claim 27
Dependent Claim
84 words
The computer readable memory of claim 18 wherein said instructions for merging include instructions for (A) assigning to each result list a probability value that is based on its average value, (B) selecting a result list preferentially based on its probability value so as to form a selected list, (C) selecting from said selected list the first entry that has not already been selected for ranking, and repeating (A), (B) and (C) in order until every entry in every result list has been selected.
References Cited (Backward Citations)
US5737595A
Cited
US5642502A
Cited
US5802515A
Cited
US6102969A
Cited
US6078914A
Cited
US5806061A
Cited
US6415281B1
Cited
US6006225A
Cited
US6370527B1
Cited
US6327590B1
Cited
US6546388B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2007-04-27 | 2007-10-27 | 2008-04-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2011-04-27 | 2011-10-27 | 2012-04-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2015-04-27 | 2015-10-27 | 2016-04-27 | $7700.00 | Window Closed / Lapsed |