Timestamp-based result cache invalidation for web search engines
|Timestamp-based result cache invalidation for web search engines|
|Author(s)||Alici S., Altingovde I.S., Ozcan R., Cambazoglu B.B., Ulusoy O.|
|Published in||SIGIR'11 - Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval|
|Keyword(s)||Cache invalidation, Freshness, Result cache, Web search (Extra: Cache invalidation, Document collection, Freshness, Generation time, Invalidation mechanism, New mechanisms, Prediction accuracy, Processing overhead, Query logs, Query results, Research challenges, Result cache, Time-to-live, Web searches, Wikipedia, Research, Search engines, User interfaces, Websites, Information retrieval)|
|Article||BASE, CiteSeerX, Google Scholar|
|Web||Ask, Bing, Google (PDF), Yahoo!|
|Download and mirrors|
|Local copy||Not available|
|Remote mirror(s)||Not available|
|Export and share|
|BibTeX, CSV, RDF, JSON|
|Browse properties · List of conference papers|
Timestamp-based result cache invalidation for web search engines is a 2011 conference paper written in English by Alici S., Altingovde I.S., Ozcan R., Cambazoglu B.B., Ulusoy O. and published in SIGIR'11 - Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval.
The result cache is a vital component for efficiency of large-scale web search engines, and maintaining the freshness of cached query results is the current research challenge. As a remedy to this problem, our work proposes a new mechanism to identify queries whose cached results are stale. The basic idea behind our mechanism is to maintain and compare generation time of query results with update times of posting lists and documents to decide on staleness of query results. The proposed technique is evaluated using a Wikipedia document collection with real update information and a real-life query log. We show that our technique has good prediction accuracy, relative to a baseline based on the time-to-live mechanism. Moreover, it is easy to implement and incurs less processing overhead on the system relative to a recently proposed, more sophisticated invalidation mechanism.
- This section requires expansion. Please, help!
Probably, this publication is cited by others, but there are no articles available for them in WikiPapers. Cited 7 time(s)