Skip to main content

Space-Limited Ranked Query Evaluation Using Adaptive Pruning

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3806))

Abstract

Evaluation of ranked queries on large text collections can be costly in terms of processing time and memory space. Dynamic pruning techniques allow both costs to be reduced, at the potential risk of decreased retrieval effectiveness. In this paper we describe an improved query pruning mechanism that offers a more resilient tradeoff between query evaluation costs and retrieval effectiveness than do previous pruning approaches.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Anh, V.N., de Kretser, O., Moffat, A.: Vector-space ranking with effective early termination. In: Croft, W.B., Harper, D.J., Kraft, D.H., Zobel, J. (eds.) Proc. 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, New Orleans, LA, September 2001, pp. 35–42. ACM Press, New York (2001)

    Chapter  Google Scholar 

  • Barroso, L.A., Dean, J., Hölzle, U.: Web search for a planet: The Google cluster architecture. IEEE Micro 23(2), 22–28 (2003)

    Article  Google Scholar 

  • Buckley, C., Lewit, A.F.: Optimization of inverted vector searches. In: Proc. 8th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Montreal, Canada, June 1985, pp. 97–110. ACM Press, New York (1985)

    Chapter  Google Scholar 

  • Buckley, C., Voorhees, E.M.: Evaluating evaluation measure stability. In: Belkin, N.J., Ingwersen, P., Leong, M.-K. (eds.) Proc. 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Athens, Greece, September 2000, pp. 33–40. ACM Press, New York (2000)

    Chapter  Google Scholar 

  • Harman, D.K., Candela, G.: Retrieving records from a gigabyte of text on a minicomputer using statistical ranking. Journal of the American Society for Information Science 41(8), 581–589 (1990)

    Article  Google Scholar 

  • Moffat, A., Zobel, J.: Self-indexing inverted files for fast text retrieval. ACM Transactions on Information Systems 14(4), 349–379 (1996)

    Article  Google Scholar 

  • Persin, M., Zobel, J., Sacks-Davis, R.: Filtered document retrieval with frequency-sorted indexes. Journal of the American Society for Information Science 47(10), 749–764 (1996)

    Article  Google Scholar 

  • Smeaton, A., van Rijsbergen, C.J.: The nearest neighbour problem in information retrieval. In: Crouch, C.J. (ed.) Proc. 4th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Oakland, California, May 1981, pp. 83–87. ACM Press, New York (1981)

    Google Scholar 

  • Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes: Compressing and Indexing Documents and Images, 2nd edn. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  • Wong, W.Y.P., Lee, D.K.: Implementations of partial document ranking using inverted files. Information Processing & Management 29(5), 647–669 (1993)

    Article  Google Scholar 

  • Zhai, C., Lafferty, J.: A study of smoothing methods for language models applied to information retrieval. ACM Transactions on Information Systems 22(2), 179–214 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lester, N., Moffat, A., Webber, W., Zobel, J. (2005). Space-Limited Ranked Query Evaluation Using Adaptive Pruning. In: Ngu, A.H.H., Kitsuregawa, M., Neuhold, E.J., Chung, JY., Sheng, Q.Z. (eds) Web Information Systems Engineering – WISE 2005. WISE 2005. Lecture Notes in Computer Science, vol 3806. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11581062_37

Download citation

  • DOI: https://doi.org/10.1007/11581062_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30017-5

  • Online ISBN: 978-3-540-32286-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics