Filters








6,117 Hits in 6.7 sec

Cost-Aware Strategies for Query Result Caching in Web Search Engines

Rifat Ozcan, Ismail Sengor Altingovde, Özgür Ulusoy
2011 ACM Transactions on the Web  
In this study, we propose cost-aware strategies for static and dynamic caching setups.  ...  Search engines and large-scale IR systems need to cache query results for efficiency and scalability purposes.  ...  ACKNOWLEDGMENTS The authors are thankful to the anonymous reviewers for their helpful feedback. We thank Rana Nelson for proofreading.  ... 
doi:10.1145/1961659.1961663 fatcat:f7hiblrixveddaes5fhn3g25a4

A Cost-Aware Strategy for Query Result Caching in Web Search Engines [chapter]

Ismail Sengor Altingovde, Rifat Ozcan, Özgür Ulusoy
2009 Lecture Notes in Computer Science  
In this study, we propose cost-aware strategies for static and dynamic caching setups.  ...  Search engines and large-scale IR systems need to cache query results for efficiency and scalability purposes.  ...  ACKNOWLEDGMENTS The authors are thankful to the anonymous reviewers for their helpful feedback. We thank Rana Nelson for proofreading.  ... 
doi:10.1007/978-3-642-00958-7_59 fatcat:wnsmmu7qqnaffny5hck7mvpusy

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

Cost-Aware Result Caching for Meta-Search Engines

Emre Bakkal, Ismail Sengor Altingovde, Ismail Hakki Toroslu
2015 Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval - SIGIR '15  
Our goal in this paper is to design cost-aware result caching approaches for meta-search engines.  ...  We also propose a novel entrylevel caching approach that is tailored for the meta-search scenario and superior to alternative approaches.  ...  Following this line of research, in this study, we tailor cost-aware caching approaches for meta-search engines.  ... 
doi:10.1145/2766462.2767813 dblp:conf/sigir/BakkalAT15 fatcat:q2idxbbvifcd7ovmq4b3e5y5wm

Workload analysis and caching strategies for search advertising systems

Conglong Li, David G. Andersen, Qiang Fu, Sameh Elnikety, Yuxiong He
2017 Proceedings of the 2017 Symposium on Cloud Computing - SoCC '17  
revenue gain of thousands of candidate advertisements per search query.  ...  Caching the results of previous computations is a potential path to reducing this expense, but traditional domain-agnostic and revenue-agnostic approaches to do so result in substantial revenue loss.  ...  We would also like to thank Ramu Movva and Chao Li at Microsoft Bing Ads for their suggestions and feedbacks on the workload analysis and cache design.  ... 
doi:10.1145/3127479.3129255 dblp:conf/cloud/LiAFEH17 fatcat:jxrvoyzpofhmzg3a6wvfiklpea

Second Chance: A Hybrid Approach for Dynamic Result Caching in Search Engines [chapter]

I. Sengor Altingovde, Rifat Ozcan, B. Barla Cambazoglu, Özgür Ulusoy
2011 Lecture Notes in Computer Science  
Web search engines are known to cache the results of previously issued queries.  ...  Moreover, using a realistic cost model, we evaluate the performance of different result prefetching strategies for the proposed hybrid cache and the baseline HTML-only cache.  ...  In practice, when a request comes for a Q, i pair (the ith result page of query Q), the Web search engine proactively fetches the F successive result pages associated with the query, that is, Q, i + 1  ... 
doi:10.1007/978-3-642-20161-5_51 fatcat:h3kfbga5yjh5bg4gsl6fm6qmtm

Second Chance

Rifat Ozcan, Ismail Sengor Altingovde, B. Barla Cambazoglu, Özgür Ulusoy
2013 ACM Transactions on the Web  
Web search engines are known to cache the results of previously issued queries.  ...  Moreover, using a realistic cost model, we evaluate the performance of different result prefetching strategies for the proposed hybrid cache and the baseline HTML-only cache.  ...  In practice, when a request comes for a Q, i pair (the ith result page of query Q), the Web search engine proactively fetches the F successive result pages associated with the query, that is, Q, i + 1  ... 
doi:10.1145/2536777 fatcat:45hx2nw7hvbp5e4w5puvplompy

A five-level static cache architecture for web search engines

Rifat Ozcan, I. Sengor Altingovde, B. Barla Cambazoglu, Flavio P. Junqueira, Özgür Ulusoy
2012 Information Processing & Management  
Caching is a crucial performance component of large-scale web search engines, as it greatly helps reducing average query response times and query processing workloads on backend search clusters.  ...  In this paper, we describe a multi-level static cache architecture that stores five different item types: query results, precomputed scores, posting lists, precomputed intersections of posting lists, and  ...  Concurrently, Altingovde et al. (2009) propose similar cost-aware strategies for static result caching.  ... 
doi:10.1016/j.ipm.2010.12.007 fatcat:ozvshcjalzbq7jxxnkydw3fthu

Performance Improvements for Search Systems Using an Integrated Cache of Lists+Intersections [chapter]

Gabriel Tolosa, Luca Becchetti, Esteban Feuerstein, Alberto Marchetti-Spaccamela
2014 Lecture Notes in Computer Science  
In addition, we propose effective strategies to select the term pairs that should populate the cache.  ...  Simulation using two datasets and a real query log reveal that the proposed approach improves overall performance in terms of total processing time, achieving savings of up to 40% in the best case.  ...  In [18] , cost aware strategies for result caching are extensively evaluated.  ... 
doi:10.1007/978-3-319-11918-2_22 fatcat:tsclp3mbrrf7tmirvy7dakqaem

FindAll

Aruna Balasubramanian, Niranjan Balasubramanian, Samuel J. Huston, Donald Metzler, David J. Wetherall
2012 Proceedings of the 8th international conference on Emerging networking experiments and technologies - CoNEXT '12  
To this end, FindAll balances the cost of running the search engine with the expected benefits of serving a web page locally.  ...  We present the design and evaluation of FindAll, a local search engine that lets users search and retrieve web pages, even in the absence of connectivity.  ...  This work was supported in part by an NSF Computing Innovation Fellowship and NSF grant CNS-1217644.  ... 
doi:10.1145/2413176.2413209 dblp:conf/conext/BalasubramanianBHMW12 fatcat:74sd76n535ggrfo5ocmmxofiku

Cache-Based Query Processing for Search Engines

B. Barla Cambazoglu, Ismail Sengor Altingovde, Rifat Ozcan, Özgür Ulusoy
2012 ACM Transactions on the Web  
the result cache of the search engine.  ...  The first strategy aggregates the results of similar queries that are previously cached in order to create synthetic results for new queries.  ...  ACKNOWLEDGMENTS We thank Ender Demirkaya for his assistance in implementing some of the methods discussed in this article.  ... 
doi:10.1145/2382616.2382617 fatcat:pd5uxzgzw5arbero5lied55smy

An Intersection Cache Based on Frequent Itemset Mining in Large Scale Search Engines

Wanwan Zhou, Ruixuan Li, Xinhua Dong, Zhiyong Xu, Weijun Xiao
2015 2015 Third IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb)  
Caching is an effective optimization in large scale web search engines, which is to reduce the underlying I/O burden of storage systems as far as possible by leveraging cache localities.  ...  In this paper, we analyze the characteristics of query term intersections in typical search engines, and present a novel three-level cache architecture, called TLMCA, which combines the intersection cache  ...  [3] introduced a model based on the stability of frequency and cost-aware result caching policies. Similarly, Gan et al.  ... 
doi:10.1109/hotweb.2015.17 dblp:conf/hotweb/ZhouLDXX15 fatcat:j7tgqlqflfbfjmshlpt53dfjsy

Dynamic index pruning for effective caching

Yohannes Tsegay, Andrew Turpin, Justin Zobel
2007 Proceedings of the sixteenth ACM conference on Conference on information and knowledge management - CIKM '07  
Search engines make use of inverted list caching in RAM and dynamic pruning schemes to reduce query evaluation times.  ...  Using two large web collections and corresponding query logs we show that, using an LRU cache, our new pruning scheme reduces the number of disk accesses during query processing time by 7%-15% over the  ...  In addition we made use of cost-aware caching eviction strategies that use attributes besides the recency of a cache element to determine what item is to be evicted.  ... 
doi:10.1145/1321440.1321592 dblp:conf/cikm/TsegayTZ07 fatcat:mc6rqugmqndpbgowsxtu5ttf6e

Two-Level Result Caching for Web Search Queries on Structured P2P Networks

Erika Rosas, Nicolas Hidalgo, Mauricio Marin
2012 2012 IEEE 18th International Conference on Parallel and Distributed Systems  
Each peer maintains a LRU result cache (RCache) used to keep the answers for queries originated in the peer itself and queries for which the peer is responsible for by contacting on-demand a Web search  ...  This paper proposes a two-level caching strategy for Web search queries which is devised to operate on P2P networks.  ...  We propose using the two strategies in combination to efficiently cope with user query traffic on a P2P result caching system for Web search queries.  ... 
doi:10.1109/icpads.2012.39 dblp:conf/icpads/RosasHM12 fatcat:afjsqfd7rrdexcghk7m35fxjey

Timestamp-based result cache invalidation for web search engines

Sadiye Alici, Ismail Sengor Altingovde, Rifat Ozcan, Berkant Barla Cambazoglu, Özgür Ulusoy
2011 Proceedings of the 34th international ACM SIGIR conference on Research and development in Information - SIGIR '11  
The result cache is a vital component for efficiency of largescale web search engines, and maintaining the freshness of cached query results is the current research challenge.  ...  As a remedy to this problem, our work proposes a new mechanism to identify queries whose cached results are stale.  ...  a web search engine cache.  ... 
doi:10.1145/2009916.2010046 dblp:conf/sigir/AliciAOCU11 fatcat:myignrh6qfaidjphggbyrhgrje
« Previous Showing results 1 — 15 out of 6,117 results