Dynamic pruning strategies enhance the efficiency of search engines, by making use of term upper bounds to decide when a document will not make the final set of k retrieved documents. After discussing different approaches for obtaining term upper bounds, we propose the use of multiple least upper bounds. Experiments are conducted on the TREC ClueWeb09 corpus, to measure the accuracy of different upper bounds.
On upper bounds for dynamic pruning
Tonellotto Nicola;
2011
Abstract
Dynamic pruning strategies enhance the efficiency of search engines, by making use of term upper bounds to decide when a document will not make the final set of k retrieved documents. After discussing different approaches for obtaining term upper bounds, we propose the use of multiple least upper bounds. Experiments are conducted on the TREC ClueWeb09 corpus, to measure the accuracy of different upper bounds.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_206220-doc_46309.pdf
solo utenti autorizzati
Descrizione: contributo
Tipologia:
Versione Editoriale (PDF)
Dimensione
152.35 kB
Formato
Adobe PDF
|
152.35 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
