Stochastic query covering

  • Authors:

  • Aris Anagnostopoulos;Luca Becchetti;Stefano Leonardi;Ida Mele;Piotr Sankowski

  • Affiliations:

  • Sapienza University of Rome, Rome, Italy;Sapienza University of Rome, Rome, Italy;Sapienza University of Rome, Rome, Italy;Sapienza University of Rome, Rome, Italy;Warsaw University, Warsaw, Poland

  • Venue:
  • Proceedings of the fourth ACM international conference on Web search and data mining
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we introduce the problem of query covering as a means to efficiently cache query results. The general idea is to populate the cache with documents that contribute to the result pages of a large number of queries, as opposed to caching the top documents for each query. It turns out that the problem is hard and solving it requires knowledge of the structure of the queries and the results space, as well as knowledge of the input query distribution. We formulate the problem under the framework of stochastic optimization; theoretically it can be seen as a stochastic universal version of set multicover. While the problem is NP-hard to be solved exactly, we show that for any distribution it can be approximated using a simple greedy approach. Our theoretical findings are complemented by experimental activity on real datasets, showing the feasibility and potential interest of query-covering approaches in practice.