Filters








2,927 Hits in 4.4 sec

PAAP

Hongyuan Ma, Wei Liu, Bingjie Wei, Liang Shi, Xiuguo Bao, Lihong Wang, Bin Wang
2014 Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval - SIGIR '14  
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.  ...  Web search engine cache admission policy has been studied by a number of researchers.  ... 
doi:10.1145/2600428.2609490 dblp:conf/sigir/MaLWSBWW14 fatcat:n3aym5mrczd6flzelsxz6hta5q

Topical Result Caching in Web Search Engines [article]

Ida Mele, Nicola Tonellotto, Ophir Frieder, Raffaele Perego
2020 arXiv   pre-print
It improves traditional SDC (Static-Dynamic Cache) that stores in a static cache the results of popular queries and manages the dynamic cache with a replacement policy for intercepting the temporal variations  ...  Caching search results is employed in information retrieval systems to expedite query processing and reduce back-end server workload.  ...  The query-result cache enhances the responsiveness of the search engine and saves resources.  ... 
arXiv:2001.03010v1 fatcat:4tolbarxhfgldcq5zkxifp357a

The impact of solid state drive on search engine cache management

Jianguo Wang, Eric Lo, Man Lung Yiu, Jiancong Tong, Gang Wang, Xiaoguang Liu
2013 Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval - SIGIR '13  
The results give insights to practitioners and researchers on how to adapt the infrastructure and how to redesign the caching policies for SSDbased search engines.  ...  Therefore, the use of SSDs to replace HDDs in a search engine infrastructure may void the cache management of existing search engines.  ...  Furthermore, the results can give the research community insights into the redesign of caching policies for SSD-based search engine infrastructures. The rest of this paper is organized as follows.  ... 
doi:10.1145/2484028.2484046 dblp:conf/sigir/WangLYTWL13 fatcat:vzbz6htjcncfxaneljvazbojki

A machine learning approach for result caching in web search engines

Tayfun Kucukyilmaz, B. Barla Cambazoglu, Cevdet Aykanat, Ricardo Baeza-Yates
2017 Information Processing & Management  
A commonly used technique for improving search engine performance is result caching.  ...  In this work, we present a machine learning approach to improve the hit rate of a result cache by facilitating a large number of features extracted from search engine query logs.  ...  Baeza-Yates, Junqueira, Plachouras, and Witschel (2007b) devise an admission policy for dynamic result caching.  ... 
doi:10.1016/j.ipm.2017.02.006 fatcat:jrszzkflr5g7pjyzvmqcc34xbu

Cache Design of SSD-Based Search Engine Architectures

Jianguo Wang, Eric Lo, Man Lung Yiu, Jiancong Tong, Gang Wang, Xiaoguang Liu
2014 ACM Transactions on Information Systems  
Based on the results, we give insights to practitioners and researchers on how to adapt the infrastructure and caching policies for SSD-based search engines.  ...  Therefore, the use of SSDs to replace HDDs in a search engine infrastructure may void the cache management of existing search engines.  ...  To the best of our knowledge, this is the first article to evaluate the impact of SSD on search engine cache management and provide insights to the redesign of caching policies for SSD-based search engine  ... 
doi:10.1145/2661629 fatcat:7vrj25m45ra35nc5rhwsfm6oau

Improved techniques for result caching in web search engines

Qingqing Gan, Torsten Suel
2009 Proceedings of the 18th international conference on World wide web - WWW '09  
Query processing is a major cost factor in operating large web search engines. In this paper, we study query result caching, one of the main techniques used to optimize query processing performance.  ...  We describe and evaluate several algorithms for weighted result caching, and study the impact of Zipf-based query distributions on result caching.  ...  Acknowledgements: We thanks Xiaojun Hei for collaboration in the early stages of this work, and Keith Ross and Dan Rubenstein for valuable discussions of caching under Zipfian distributions.  ... 
doi:10.1145/1526709.1526768 dblp:conf/www/GanS09 fatcat:twihgvjmgretthjptzbqxyw3x4

Yahoo!: towards a distributed search engine

Ricardo Baeza-Yates
2008 Proceedings of the Third International ICST Conference on Scalable Information Systems  
with compressed postings -30% of M for caching query results 35 WAN System Simulation • Distributed search engine -Broker holds query results cache -Query processors hold posting list  ...  used data -Memory pages, disk, resources in LAN / WAN 20 Caching in Web Search EnginesCaching query results versus caching posting lists • Static versus dynamic caching policies • Memory  ...  of set G of most frequently retrieved documents -Slackness factor replacing b j with (1-)b j Query Processing Retrieve top-n local results  ... 
doi:10.4108/infoscale.2008.31 dblp:conf/infoscale/Baeza-Yates08 fatcat:mgrnvdx42rfapi5nfzxz4yjmje

A financial cost metric for result caching

Fethi Burak Sazoglu, B. Barla Cambazoglu, Rifat Ozcan, Ismail Sengor Altingovde, Özgür Ulusoy
2013 Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval - SIGIR '13  
Web search engines cache results of frequent and/or recent queries. Result caching strategies can be evaluated using different metrics, hit rate being the most well-known.  ...  Recent works take the processing overhead of queries into account when evaluating the performance of result caching strategies and propose cost-aware caching strategies.  ...  INTRODUCTION Web search engines cache query results for efficiency reasons. In the literature, the performance of different query result caching strategies is evaluated using different metrics.  ... 
doi:10.1145/2484028.2484182 dblp:conf/sigir/SazogluCOAU13 fatcat:uqcqpjaknvb5deqxewtnp5z46y

Three-Level Caching for Efficient Query Processing in Large Web Search Engines

Xiaohui Long, Torsten Suel
2006 World wide web (Bussum)  
We also observe that a careful selection of cache admission and eviction policies is crucial for best overall performance.  ...  Large web search engines have to answer thousands of queries per second with interactive response times.  ...  Cache admission policies: We experimented with several techniques for limiting the number of projections that are created and inserted into the cache.  ... 
doi:10.1007/s11280-006-0221-0 fatcat:tmer4oaw7zfwlcvqojhtfk5zjm

Three-level caching for efficient query processing in large Web search engines

Xiaohui Long, Torsten Suel
2005 Proceedings of the 14th international conference on World Wide Web - WWW '05  
We also observe that a careful selection of cache admission and eviction policies is crucial for best overall performance.  ...  Large web search engines have to answer thousands of queries per second with interactive response times.  ...  Cache admission policies: We experimented with several techniques for limiting the number of projections that are created and inserted into the cache.  ... 
doi:10.1145/1060745.1060785 dblp:conf/www/LongS05 fatcat:xbodm26ml5fk5lsrqzhxe7wmti

Static query result caching revisited

Rifat Ozcan, Ismail Sengor Altingovde, Özgür Ulusoy
2008 Proceeding of the 17th international conference on World Wide Web - WWW '08  
Query result caching is an important mechanism for search engine efficiency. In this study, we first review several query features that are used to determine the contents of a static result cache.  ...  Experimental results show that this new feature achieves hit ratios better than those of the previously proposed features.  ...  INTRODUCTION Caching query results and inverted lists for individual query terms are two basic methods for improving the efficiency of large scale search engines.  ... 
doi:10.1145/1367497.1367710 dblp:conf/www/OzcanAU08 fatcat:4j3fkiqninailmdeib3ozbolqe

Efficiency and Effectiveness [chapter]

2013 Leadership in the Open  
Query result caching is an important mechanism for search engine efficiency. In this study, we first review several query features that are used to determine the contents of a static result cache.  ...  Experimental results show that this new feature achieves hit ratios better than those of the previously proposed features.  ...  INTRODUCTION Caching query results and inverted lists for individual query terms are two basic methods for improving the efficiency of large scale search engines.  ... 
doi:10.1201/b14938-8 fatcat:ox6hnis7k5antiaikwnh6bwtge

Timestamp-based cache invalidation for search engines

Sadiye Alici, Ismail Sengor Altingovde, Rifat Ozcan, B. Barla Cambazoglu, Özgür Ulusoy
2011 Proceedings of the 20th international conference companion on World wide web - WWW '11  
We propose a new mechanism to predict stale queries in the result cache of a search engine. The novelty of our approach is in the use of timestamps in staleness predictions.  ...  Abundance of cheap storage, however, makes it attractive for search engines to cache practically all past query results.  ...  INTRODUCTION Result caching is vital to reduce the backend query workload in search engines.  ... 
doi:10.1145/1963192.1963195 dblp:conf/www/AliciAOCU11 fatcat:4skxkwbzqzhgfdb7rveude4jge

TinyLFU: A Highly Efficient Cache Admission Policy [article]

Gil Einziger, Roy Friedman, Ben Manes
2015 arXiv   pre-print
This paper proposes to use a frequency based cache admission policy in order to boost the effectiveness of caches subject to skewed access distributions.  ...  W-TinyLFU is demonstrated to obtain equal or better hit-ratios than other state of the art replacement policies on these traces. It is the only scheme to obtain such good results on all traces.  ...  Conclusion We have introduce TinyLFU, an approximate frequency based cache admission policy.  ... 
arXiv:1512.00727v2 fatcat:y77u3ve3ina6dgcuxtv7ym6pyy

Writes Hurt: Lessons in Cache Design for Optane NVRAM [article]

Alexandra Fedorova, Keith Smith, Keith Bostic, Alexander Gorrod, Sue LoVerso, Michael Cahill
2022 arXiv   pre-print
Therefore, an admission policy that indiscriminately admits new data (and thus generates writes), severely limits the rate of data retrieval and results in exceedingly poor performance for the cache overall  ...  Our cache is decoupled from the rest of the storage engine and uses generic metrics to guide its admission policy; therefore our design can be easily adopted in other systems.  ...  NVCache is decoupled from the rest of the storage engine and our new admission policy relies only on the rates of data admission, removal and lookup for its decisions, so our design is easy to adopt in  ... 
arXiv:2205.14122v1 fatcat:ejdcwnqz5jfivgzw23f5pov2ze
« Previous Showing results 1 — 15 out of 2,927 results