Skip to main content

Web Search Result Caching and Prefetching

  • Reference work entry
  • First Online:
Encyclopedia of Database Systems

Synonyms

Paging in Web search engines; Search engine caching and prefetching; Search engine query result caching

Definition

Caching is a well-known concept in systems with multiple tiers of storage. For simplicity, consider a system storing N objects in relatively slow memory, that also has a smaller but faster memory buffer of capacity k which can store copies of k of the N objects (N > > k). This fast memory buffer is called the cache. The storage system is presented with a continuous stream of queries, each requesting one of the N objects. If the object is stored in the cache, a cache hit occurs and the object is quickly retrieved. Otherwise, a cache miss occurs, and the object is retrieved from the slower memory. At this point, the storage system can opt to save the newly retrieved object in the cache. When the cache is full (i.e., already contains k objects), this entails evicting some currently cached object. Such decisions are handled by a replacement policy, whose goal is to...

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Recommended Reading

  1. Baeza-Yates R, Gionis A, Junqueira F, Murdock V, Plachouras V, Silvestri F. The impact of caching on search engines. In: Proceedings of the 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval; 2007. p. 183–90.

    Google Scholar 

  2. Baeza-Yates R, Junqueira F, Plachouras V, Witschel HF. Admission policies for caches of search engine results. In: Proceedings of the 14th International Symposium on String Processing and Information Retrieval; 2007. p. 74–85.

    Google Scholar 

  3. Belady LA. A study of replacement algorithms for a virtual-storage computer. IBM Syst J. 1966;5(2):78–101.

    Article  Google Scholar 

  4. 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 Trans Inf Syst. 2006;24(1):51–78.

    Article  Google Scholar 

  5. Karedla R, Love JS, Wherry BG. Caching strategies to improve disk system performance. Computer. 1994;27(3):38–46.

    Article  Google Scholar 

  6. Lempel R, Moran S. Optimizing result prefetching in web search engines with segmented indices. In: Proceedings of the 28th International Conference on Very Large Data Bases; 2002. p. 370–81.

    Chapter  Google Scholar 

  7. Lempel R, Moran S. Predictive caching and prefetching of query results in search engines. In: Proceedings of the 12th International World Wide Web Conference; 2003. p. 19–28.

    Google Scholar 

  8. Lempel R, Moran S. Competitive caching of query results in search engines. Theory Comput Sci. 2004;324(2):253–71.

    Article  MathSciNet  MATH  Google Scholar 

  9. Lempel R, Moran S. Optimizing result prefetching in web search engines with segmented indices. ACM Trans Internet Tech. 2004;4(1):31–59.

    Article  Google Scholar 

  10. Long X, Suel T. Three-level caching for efficient query processing in large web search engines. In: Proceedings of the 14th International World Wide Web Conference; 2005. p. 257–66.

    Google Scholar 

  11. Markatos EP. On caching search engine query results. Comput Commun. 2001;24(2):137–43.

    Article  Google Scholar 

  12. Saraiva P, Moura E, Ziviani N, Meira W, Fonseca R, Ribeiro-Neto B. Rank-preserving two-level caching for scalable search engines. In: Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval; 2001. p. 51–8.

    Google Scholar 

  13. Silverstein C, Henzinger M, Marais H, Moricz M. Analysis of a very large altavista query log. Technical Report 1998-014, Compaq Systems Research Center. Oct 1998.

    Google Scholar 

  14. Silvestri F, Fagni T, Orlando S, Palmerini P, Perego R. A hybrid strategy for caching web search engine results. In: Proceedings of the 12th International World Wide Web Conference; 2003 (Poster).

    Google Scholar 

  15. Sleator DD, Tarjan RE. Amortized efficiency of list update and paging rules. Commun ACM. 1985;28(2):202–8.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fabrizio Silvestri .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Lempel, R., Silvestri, F. (2018). Web Search Result Caching and Prefetching. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_464

Download citation

Publish with us

Policies and ethics