| 摘要 |
A meta search engine ( 1 ) receives a query (q<SUB>T</SUB>) from a user (U), and submits adapted queries (q<SUB>1</SUB>-q<SUB>n</SUB>) to n search engines (S<SUB>1</SUB>-S<SUB>n</SUB>). The results (R<SUB>1</SUB>-R<SUB>n</SUB>) are adapted (R<SUB>1</SUB>'-R<SUB>n</SUB>') and combined to provide a result set R'. In parallel, the meta search engine ( 1 ) accesses a selected hit matrix (H) populated with values for correspondence of queries q<SUB>1</SUB>-q<SUB>m </SUB>with web pages p<SUB>i</SUB>-p<SUB>n</SUB>. These values are the number of "hits" for pervious searches. The pages (R'') retrieved from a row for q<SUB>T </SUB>are combined with the search engine (S<SUB>1</SUB>-S<SUB>n</SUB>) results to provide a final result but which is ranked according to previous search experience. The hit matrix may be dynamically selected according to a user community. The query (q<SUB>T</SUB>) need not exactly match a hit matrix query (q<SUB>1</SUB>-q<SUB>n</SUB>) as rows can be selected according to similarity to the current query q<SUB>T </SUB>with weightings applied.
|
