ACM Computing Surveys (CSUR)
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
Predictive caching and prefetching of query results in search engines
WWW '03 Proceedings of the 12th international conference on World Wide Web
Bypass Caching: Making Scientific Databases Good Network Citizens
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Three-level caching for efficient query processing in large Web search engines
WWW '05 Proceedings of the 14th international conference on World Wide Web
ACM Transactions on Information Systems (TOIS)
Analysis of Caching and Replication Strategies for Web Applications
IEEE Internet Computing
The impact of caching on search engines
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
On caching search engine query results
Computer Communications
Performance of compressed inverted list caching in search engines
Proceedings of the 17th international conference on World Wide Web
Static query result caching revisited
Proceedings of the 17th international conference on World Wide Web
Design trade-offs for search engine caching
ACM Transactions on the Web (TWEB)
Improved techniques for result caching in web search engines
Proceedings of the 18th international conference on World wide web
A Cost-Aware Strategy for Query Result Caching in Web Search Engines
ECIR '09 Proceedings of the 31th European Conference on IR Research on Advances in Information Retrieval
Mining Query Logs: Turning Search Usage Data into Knowledge
Foundations and Trends in Information Retrieval
Caching search engine results over incremental indices
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Cost-Aware Strategies for Query Result Caching in Web Search Engines
ACM Transactions on the Web (TWEB)
Timestamp-based result cache invalidation for web search engines
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Towards a distributed search engine
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Adaptive time-to-live strategies for query result caching in web search engines
ECIR'12 Proceedings of the 34th European conference on Advances in Information Retrieval
Modeling static caching in web search engines
ECIR'12 Proceedings of the 34th European conference on Advances in Information Retrieval
Prefetching query results and its impact on search engines
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Online result cache invalidation for real-time web search
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Cache-Based Query Processing for Search Engines
ACM Transactions on the Web (TWEB)
Proceedings of the sixth ACM international conference on Web search and data mining
HEC: improving endurance of high performance flash-based cache devices
Proceedings of the 6th International Systems and Storage Conference
Exploiting query term correlation for list caching in web search engines
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Strategies for setting time-to-live values in result caches
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Second Chance: A Hybrid Approach for Dynamic Result Caching and Prefetching in Search Engines
ACM Transactions on the Web (TWEB)
Hi-index | 0.00 |
This paper studies the impact of the tail of the query distribution on caches of Web search engines, and proposes a technique for achieving higher hit ratios compared to traditional heuristics such as LRU. The main problem we solve is the one of identifying infrequent queries, which cause a reduction on hit ratio because caching them often does not lead to hits. To mitigate this problem, we introduce a cache management policy that employs an admission policy to prevent infrequent queries from taking space of more frequent queries in the cache. The admission policy uses either stateless features, which depend only on the query, or stateful features based on usage information. The proposed management policy is more general than existing policies for caching of search engine results, and it is fully dynamic. The evaluation results on two different query logs show that our policy achieves higher hit ratios when compared to previously proposed cache management policies.