Hongyuan Ma
ABSTRACT
Caching query results is an efficient technique for Web search engines. Admission policy can prevent infrequent queries from taking space of more frequent queries in the cache. In this paper we present two novel admission policies tailored for query results cache. These policies are based on query results prefetching information. We also propose a demote operation for the query results cache to improve the cache hit ratio. We then use a trace of over 5 million queries to evaluate our admission policies, as well as traditional policies. Experimental results show that our prefetch-aware admission policies can achieve hit ratios better than state-of-the-art admission policies.
- S. Jonassen, B.B. Cambazoglu, and F. Silvestri. Prefetching query results and its impact on search engines. In Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval. SIGIR'12. ACM. Google Scholar
Digital Library
- R. Baeza-Yates, F. Junqueira, V. Plachouras and H.F. Witschel. Admission Policies for Caches of Search Engine Results. In Proceedings of the 14th String Processing and Information Retrieval Conference. SPIRE'07. Springer. Google ScholarDigital Library
- T. Fagni, R. Perego, F. Silvestri and S. Orlando. Boosting the performance of Web search engines: Caching and prefetching query results by exploiting historical usage data. ACM TOIS 24, 1 (Jan. 2006), 51--78. Google ScholarDigital Library
- H.Y. Ma and B. Wang. User-aware caching and prefetching query results in web search engines. In Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval. SIGIR'12. ACM. Google ScholarDigital Library
- Y.N. Li, S. Zhang, B. Wang and J.T. Li. Characteristics of Chinese web searching: A large-scale analysis of Chinese query logs. Journal of Computational Information Systems, 4(3):1127--1136, 2008.Google Scholar
Index Terms
- PAAP: prefetch-aware admission policies for query results cache in web search engines
Recommendations
TinyLFU: A Highly Efficient Cache Admission Policy
Special Issue on MSST 2017 and Regular PapersThis article proposes to use a frequency-based cache admission policy in order to boost the effectiveness of caches subject to skewed access distributions. Given a newly accessed item and an eviction candidate from the cache, our scheme decides, based ...
Criticality aware tiered cache hierarchy: a fundamental relook at multi-level cache hierarchies
ISCA '18: Proceedings of the 45th Annual International Symposium on Computer ArchitectureOn-die caches are a popular method to help hide the main memory latency. However, it is difficult to build large caches without substantially increasing their access latency, which in turn hurts performance. To overcome this difficulty, on-die caches ...
Achieving High Performance in Bus-Based Shared-Memory Multiprocessors
In bus-based SMPs, cache misses and bus traffic form key obstacles to high performance. To overcome these problems, several techniques have been proposed: cache prefetching, read snarfing, software-controlled updating, and cache injection for reducing ...
Comments