Advertisement

On Upper Bounds for Dynamic Pruning

  • Craig Macdonald
  • Nicola Tonellotto
  • Iadh Ounis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6931)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Croft, W.B., Metzler, D., Strohman, T.: Search Engines – Information Retrieval in Practice. Addison-Wesley, Reading (2009)Google Scholar
  2. 2.
    Moffat, A., Zobel, J.: Self-indexing inverted files for fast text retrieval. Trans. on Information Systems 14(4), 349–379 (1996)CrossRefGoogle Scholar
  3. 3.
    Broder, A.Z., Carmel, D., Herscovici, M., Soffer, A., Zien, J.: Efficient query evaluation using a two-level retrieval process. In: Proc. of CIKM 2003 (2003)Google Scholar
  4. 4.
    Macdonald, C., Ounis, I., Tonellotto, N.: Upper bound approximations for dynamic pruning. Trans. on Information Systems (in press, 2011)Google Scholar
  5. 5.
    Strohman, T.: Efficient Processing of Complex Features for Information Retrieval. PhD thesis (2007)Google Scholar
  6. 6.
    Hawking, D., Upstill, T., Craswell, N.: Towards better weighting of anchors. In: Proc. SIGIR 2005 (2005)Google Scholar
  7. 7.
    Robertson, S.E., Walker, S., Hancock-Beaulieu, M., Gull, A., Lau, M.: Okapi at TREC. In: Proc. of TREC-1 (1992)Google Scholar
  8. 8.
    Craswell, N., Jones, R., Dupret, G., Viegas, E. (eds.): Proceedings of the Web Search Click Data Workshop at WSDM 2009 (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Craig Macdonald
    • 1
  • Nicola Tonellotto
    • 2
  • Iadh Ounis
    • 1
  1. 1.School of Computing ScienceUniversity of GlasgowGlasgowUK
  2. 2.Information Science and Technologies InstituteCNRPisaItaly

Personalised recommendations