Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive paging with locality of reference
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Journal of Algorithms
Randomized and multipointer paging with locality of reference
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
On competitive on-line paging with lookahead
Theoretical Computer Science
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Paging against a distribution and IP networking
Journal of Computer and System Sciences
Real life, real users, and real needs: a study and analysis of user queries on the web
Information Processing and Management: an International Journal
Rank-preserving two-level caching for scalable search engines
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Journal of Algorithms
Optimal crawling strategies for web search engines
Proceedings of the 11th international conference on World Wide Web
Web caching with request reordering
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SIAM Journal on Computing
Competitive Analysis of Paging
Developments from a June 1996 seminar on Online algorithms: the state of the art
Integrated document caching and prefetching in storage hierarchies based on Markov-chain predictions
The VLDB Journal — The International Journal on Very Large Data Bases
Predictive caching and prefetching of query results in search engines
WWW '03 Proceedings of the 12th international conference on World Wide Web
Optimizing result prefetching in web search engines with segmented indices
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Inverted files for text search engines
ACM Computing Surveys (CSUR)
An attentive self-organizing neural model for text mining
Expert Systems with Applications: An International Journal
Mining Query Logs: Turning Search Usage Data into Knowledge
Foundations and Trends in Information Retrieval
Flood little, cache more: effective result-reuse in P2P IR systems
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Caching search engine results over incremental indices
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Engineering basic algorithms of an in-memory text search engine
ACM Transactions on Information Systems (TOIS)
| Hi-index | 0.00 |
We study the problem of caching query result pages in Web search engines. Popular search engines receive millions of queries per day, and for each query, return a result page to the user who submitted the query. The user may request additional result pages for the same query, submit a new query, or quit searching altogether. An efficient scheme for caching query result pages may enable search engines to lower their response time and reduce their hardware requirements.This work studies query result caching within the framework of the competitive analysis of algorithms. We define a discrete time stochastic model for the manner in which queries are submitted to search engines by multiple user sessions. We then present an adaptation of a known online paging scheme to this model. The expected number of cache misses of the resulting algorithm is no greater than 4 times the expected number of misses that any online caching algorithm will experience under our specific model of query generation.