poster

Caching search engine results over incremental indices

Authors:

Hugo ZaragozaAuthors Info & Claims

WWW '10: Proceedings of the 19th international conference on World wide web

Pages 1065 - 1066

https://doi.org/10.1145/1772690.1772806

Published: 26 April 2010 Publication History

Get Access

Abstract

A Web search engine must update its index periodically to incorporate changes to the Web, and we argue in this work that index updates fundamentally impact the design of search engine result caches. Index updates lead to the problem of cache invalidation: invalidating cached entries of queries whose results have changed. To enable efficient invalidation of cached results, we propose a framework for developing invalidation predictors and some concrete predictors. Evaluation using Wikipedia documents and a query log from Yahoo! shows that selective invalidation of cached search results can lower the number of query re-evaluations by as much as 30% compared to a baseline time-to-live scheme, while returning results of similar freshness.

References

[1]

Ricardo A. Baeza-Yates and Berthier A. Ribeiro-Neto. Modern Information Retrieval. ACM Press / Addison Wesley, New York, NY, 1999.

Digital Library

Google Scholar

[2]

Evangelos P. Markatos. On Caching Search Engine Query Results. Computer Communications, 24(2):137--143, 2001.

Digital Library

Google Scholar

Cited By

View all

Dasgupta AKumar RSarlós TBarrett RCummings RAgichtein EGabrilovich E(2017)Caching with Dual CostsProceedings of the 26th International Conference on World Wide Web Companion10.1145/3041021.3054187(643-652)Online publication date: 3-Apr-2017
https://dl.acm.org/doi/10.1145/3041021.3054187
Shraer AGurevich MFontoura MJosifovski V(2013)Top-k publish-subscribe for social annotation of newsProceedings of the VLDB Endowment10.14778/2536336.25363406:6(385-396)Online publication date: 1-Apr-2013
https://dl.acm.org/doi/10.14778/2536336.2536340
Ozcan RAltingovde ICambazoglu BUlusoy Ö(2013)Second ChanceACM Transactions on the Web10.1145/25367778:1(1-22)Online publication date: 1-Dec-2013
https://dl.acm.org/doi/10.1145/2536777
Show More Cited By

Index Terms

Caching search engine results over incremental indices
1. Information systems
  1. Information retrieval
    1. Information retrieval query processing

Recommendations

Caching search engine results over incremental indices
SIGIR '10: Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval

A Web search engine must update its index periodically to incorporate changes to the Web. We argue in this paper that index updates fundamentally impact the design of search engine result caches, a performance-critical component of modern search ...
Re-ranking search results using query logs
CIKM '06: Proceedings of the 15th ACM international conference on Information and knowledge management

This work addresses two common problems in search, frequently occurring with underspecified user queries: the top-ranked results for such queries may not contain documents relevant to the user's search intent, and fresh and relevant pages may not get ...
Discovering the representative of a search engine
CIKM '01: Proceedings of the tenth international conference on Information and knowledge management

Given a large number of search engines on the Internet, it is difficult for a person to determine which search engines could serve his/her information needs. A common solution is to construct a metasearch engine on top of the search engines. Upon ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

WWW '10: Proceedings of the 19th international conference on World wide web

April 2010

1407 pages

ISBN:9781605587998

DOI:10.1145/1772690

General Chairs:
Michael Rappa
North Carolina State University, USA
,
Paul Jones
University of North Carolina at Chapel Hill, USA
,
Program Chairs:
Juliana Freire
University of Utah, USA
,
Soumen Chakrabarti
Indian Institute of Technology, India

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 April 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

WWW '10

WWW '10: The 19th International World Wide Web Conference

April 26 - 30, 2010

North Carolina, Raleigh, USA

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
259
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dasgupta AKumar RSarlós TBarrett RCummings RAgichtein EGabrilovich E(2017)Caching with Dual CostsProceedings of the 26th International Conference on World Wide Web Companion10.1145/3041021.3054187(643-652)Online publication date: 3-Apr-2017
https://dl.acm.org/doi/10.1145/3041021.3054187
Shraer AGurevich MFontoura MJosifovski V(2013)Top-k publish-subscribe for social annotation of newsProceedings of the VLDB Endowment10.14778/2536336.25363406:6(385-396)Online publication date: 1-Apr-2013
https://dl.acm.org/doi/10.14778/2536336.2536340
Ozcan RAltingovde ICambazoglu BUlusoy Ö(2013)Second ChanceACM Transactions on the Web10.1145/25367778:1(1-22)Online publication date: 1-Dec-2013
https://dl.acm.org/doi/10.1145/2536777
Cai SChen HXiao ZMing Z(2012)An efficient block structure for incremental inverted indexing2012 IEEE International Conference on Information Science and Technology10.1109/ICIST.2012.6221735(693-697)Online publication date: Mar-2012
https://doi.org/10.1109/ICIST.2012.6221735
Ozcan RAltingovde IUlusoy Ö(2011)Cost-Aware Strategies for Query Result Caching in Web Search EnginesACM Transactions on the Web10.1145/1961659.19616635:2(1-25)Online publication date: 1-May-2011
https://dl.acm.org/doi/10.1145/1961659.1961663

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

EPUB

View this article in ePub.

ePub

Abstract

References

Cited By

Index Terms

Recommendations