Strategies for setting time-to-live values in result caches

Download

index.pdf

Date

2013-12-11

Author

Sazoglu, Fethi Burak
Cambazoglu, B. Barla
Ozcan, Rifat
Altıngövde, İsmail Sengör
Ulusoy, Özgür

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

158
views

92
downloads

In web query result caching, staleness of queries are often bounded via a time-to-live (TTL) mechanism, which expires the validity of cached query results at some point in time. In this work, we evaluate the performance of three alternative TTL mechanisms: time-based TTL, frequency-based TTL, and click-based TTL. Moreover, we propose hybrid approaches obtained by pair-wise combination of these mechanisms. Our results indicate that combining time-based TTL with frequency-based TTL yields superior performance (i.e., lower stale query traffic and less redundant computation) than using a particular mechanism in isolation.

Subject Keywords

Web search engines, Result caching, Time-to-live

URI

https://hdl.handle.net/11511/43001

DOI

https://doi.org/10.1145/2505515.2507886

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

A five-level static cache architecture for web search engines Ozcan, Rifat; Altıngövde, İsmail Sengör; Barla Cambazoglu, B.; Junqueira, Flavio P.; Ulusoy, Ozgur (2012-09-01) 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 documents. Moreover, we propose a greedy heuristic to prioritize items for caching, based on gains computed by us...
Efficient processing of category-restricted queries for Web directories Altıngövde, İsmail Sengör; Ulusoy, Oezguer (2008-01-01) We show that a cluster-skipping inverted index (CS-IIS) is a practical and efficient file structure to support category-restricted queries for searching Web directories. The query processing strategy with CS-IIS improves CPU time efficiency without imposing any limitations on the directory size.
Utilization of navigational queries for result presentation and caching in search engines Ozcan, Rifat; Altıngövde, İsmail Sengör; Ulusoy, Özgür (2008-12-01) We propose result page models with varying granularities for navigational queries and show that this approach provides a better utilization of cache space and reduces bandwidth requirements.
Search result diversification for selective search Küçükoglu, Emre Can; Altıngövde, İsmail Sengör; Department of Computer Engineering (2019) Our work explores the performance of result diversification methods in the selective search scenario, where the underlying document collection is topically partitioned across several nodes and the search is conducted only at a subset of these nodes. In particular, we investigate whether diversification at each node is superior to previous approaches in the literature, i.e., diversification at the broker node applied before the resource selection or after the result merging stages. We also compare performanc...
On the Efficiency of Selective Search Hafizoglu, Fatih; Kucukoglu, Emre Can; Altıngövde, İsmail Sengör (2017-04-13) Our work shows that the query latency for selective search over a topically partitioned collection can be reduced by up to 55%. We achieve this by physically storing the documents in each topical cluster across all shards and building a cluster-skipping index at each shard. Our approach also achieves uniform load balance among the shards.

Citation Formats

F. B. Sazoglu, B. B. Cambazoglu, R. Ozcan, İ. S. Altıngövde, and Ö. Ulusoy, “Strategies for setting time-to-live values in result caches,” 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/43001.