Analysis of Cost-Aware Policies for Intersection Caching in Search Nodes

Feuerstein, Esteban; Tolosa, Gabriel Hernán

doi:10.1109/sccc.2013.23

Cited by 2 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Deeper studies regarding cost aware intersection caching are presented in [8] and [9]. Basically, these works focus on two di↵erent scenarios: with the inverted index residing on disk and in main memory.…”

Section: Size(t)mentioning

confidence: 99%

See 1 more Smart Citation

Performance improvements for search systems using an integrated cache of lists + intersections

et al. 2017

Self Cite

View full text Add to dashboard Cite

Modern information retrieval systems use several levels of caching to speedup computation by exploiting frequent, recent or costly data used in the past. Previous studies show that the use of caching techniques is crucial in search engines, as it helps reducing query response times and processing workloads on search servers. In this work we propose and evaluate a static cache that acts simultaneously as list and intersection cache, offering a more efficient way of handling cache space. We also use a query resolution strategy that takes advantage of the existence of this cache to reorder the query execution sequence. In addition, we propose effective strategies to select the term pairs that should populate the cache. We also represent the data in cache in both raw and compressed forms and evaluate the differences between them using different configurations of cache sizes. The results show that the proposed Integrated Cache outperforms the standard posting lists cache in most of the cases, taking advantage not only of the intersection cache but also the query resolution strategy

show abstract

Section: Size(t)mentioning

confidence: 99%

“…To calculate C cpu we run a list intersection benchmark on the same machine. This cost estimation methodology is also used in [8]. We adopt this approach because running real tests is too expensive considering our dataset.…”

Section: Cost Modelmentioning

confidence: 99%

Performance improvements for search systems using an integrated cache of lists + intersections

et al. 2017

Self Cite

View full text Add to dashboard Cite

show abstract

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

Tolosa

Becchetti

Feuerstein

et al. 2014

String Processing and Information Retrieval

Self Cite

View full text Add to dashboard Cite

Modern information retrieval systems use sophisticated techniques for e ciency and scalability purposes. Among the most frequent such techniques is the implementation of several levels of caching. The main goal of a cache is to speedup computation by exploiting frequent, recent or costly data used in the past. In this study we propose and evaluate a static cache that works simultaneously as list and intersection cache, o↵ering a more e cient way of handling cache space. In addition, we propose e↵ective 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.

show abstract

Analysis of Cost-Aware Policies for Intersection Caching in Search Nodes

Cited by 2 publications

References 12 publications

Performance improvements for search systems using an integrated cache of lists + intersections

Performance improvements for search systems using an integrated cache of lists + intersections

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

Contact Info

Product

Resources

About