Skip to main content
SpringerLink
Log in
Book cover

European Conference on Information Retrieval

ECIR 2019: Advances in Information Retrieval pp 155–162Cite as

On the Impact of Storing Query Frequency History for Search Engine Result Caching

  • Conference paper
  • First Online:

  • 1800 Accesses

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

Abstract

We investigate the impact of the size of query frequency history and its compact representation in memory for search result caching.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

References

  1. Arlitt, M., Cherkasova, L., Dilley, J., Friedrich, R., Jin, T.: Evaluating content management techniques for web proxy caches. ACM SIGMETRICS Perform. Eval. Rev. 27(4), 3–11 (2000)

    Article  Google Scholar 

  2. Baeza-Yate, R., Junqueira, F., Plachouras, V., Witschel, H.F.: Admission policies for caches of search engine results. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol. 4726, pp. 74–85. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-75530-2_7

    Chapter  Google Scholar 

  3. Cambazoglu, B.B., Baeza-Yates, R.A.: Scalability Challenges in Web Search Engines. Synthesis Lectures on Information Concepts, Retrieval, and Services. Morgan & Claypool Publishers, San Rafael (2015)

    Book  Google Scholar 

  4. Einziger, G., Friedman, R.: Tinylfu: a highly efficient cache admission policy. In: 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP), pp. 146–153 (2014)

    Google Scholar 

  5. Fagni, T., Perego, R., Silvestri, F., Orlando, S.: Boosting the performance of web search engines: caching and prefetching query results by exploiting historical usage data. ACM TOIS 24(1), 51–78 (2006)

    Article  Google Scholar 

  6. Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Trans. Netw. 8(3), 281–293 (2000)

    Article  Google Scholar 

  7. Gan, Q., Suel, T.: Improved techniques for result caching in web search engines. In: Proceedings of the WWW 2009, pp. 431–440 (2009)

    Google Scholar 

  8. Jonassen, S., Cambazoglu, B.B., Silvestri, F.: Prefetching query results and its impact on search engines. In: Proceedings of SIGIR 2012, pp. 631–640 (2012)

    Google Scholar 

  9. Ozcan, R., Altingovde, I.S., Cambazoglu, B.B., Junqueira, F.P.: Özgür Ulusoy: a five-level static cache architecture for web search engines. Inf. Process. Manag. 48(5), 828–840 (2012)

    Article  Google Scholar 

  10. Ozcan, R., Altingovde, I.S., Cambazoglu, B.B., Ulusoy, Ö.: Second chance: a hybrid approach for dynamic result caching and prefetching in search engines. ACM Trans. Web 8(1), 3 (2013)

    Article  Google Scholar 

  11. Ozcan, R., Altingövde, I.S., Ulusoy, O.: Cost-aware strategies for query result caching in web search engines. ACM Trans. Web 5(2), 9:1–9:25 (2011)

    Article  Google Scholar 

  12. Pass, G., Chowdhury, A., Torgeson, C.: A picture of search. In: Proceedings of the InfoScale 2006, p. 1 (2006)

    Google Scholar 

  13. Podlipnig, S., Böszörményi, L.: A survey of web cache replacement strategies. ACM Comput. Surv. 35(4), 374–398 (2003)

    Article  Google Scholar 

  14. Shah, K., Mitra, A., Matani, D.: An O(1) algorithm for implementing the LFU cache eviction scheme. Technical report (2010)

    Google Scholar 

  15. Silvestri, F.: Mining query logs: turning search usage data into knowledge. Found. Trends Inf. Retrieval 4(1–2), 1–174 (2010). https://doi.org/10.1561/1500000013

    Article  MATH  Google Scholar 

Download references

Acknowledgements

This work is partially funded by The Scientific and Technological Research Council of Turkey (TÜBİTAK) under the grant no. 117E861 and Turkish Academy of Sciences Distinguished Young Scientist Award (TÜBA-GEBİP 2016).

Author information

Authors and Affiliations

  1. Middle East Technical University, Ankara, Turkey

    Erman Yafay & Ismail Sengor Altingovde

  2. ASELSAN, Ankara, Turkey

    Erman Yafay

Authors
  1. Erman Yafay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ismail Sengor Altingovde
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ismail Sengor Altingovde .

Editor information

Editors and Affiliations

  1. University of Strathclyde, Glasgow, UK

    Leif Azzopardi

  2. Bauhaus Universität Weimar, Weimar, Germany

    Benno Stein

  3. Universität Duisburg-Essen, Duisburg, Germany

    Norbert Fuhr

  4. GESIS - Leibniz Institute for the Social Sciences, Cologne, Germany

    Philipp Mayr

  5. Delft University of Technology, Delft, The Netherlands

    Claudia Hauff

  6. University of Twente, Enschede, The Netherlands

    Djoerd Hiemstra

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yafay, E., Altingovde, I.S. (2019). On the Impact of Storing Query Frequency History for Search Engine Result Caching. In: Azzopardi, L., Stein, B., Fuhr, N., Mayr, P., Hauff, C., Hiemstra, D. (eds) Advances in Information Retrieval. ECIR 2019. Lecture Notes in Computer Science(), vol 11438. Springer, Cham. https://doi.org/10.1007/978-3-030-15719-7_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-15719-7_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-15718-0

  • Online ISBN: 978-3-030-15719-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation