1 Ocak 2019 Konferans bildirisi Açık Erişim

Yafay, Erman; Altingovde, Ismail Sengor

Citation Style Language JSON

{
  "DOI": "10.1145/3357384.3358154", 
  "abstract": "We propose to use a score cache, which stores the score of the k.th result of a query, to accelerate top-k query processing with dynamic pruning methods (i.e., WAND and BMW). We introduce heuristics that, for a new query, generate its subsets and probe the score cache to obtain a lower-bound on its score threshold. Our experiments show up to 8.6% savings in mean processing time for the queries that are not seen before, i.e., cannot benefit from a result cache.", 
  "author": [
    {
      "family": "Yafay", 
      "given": " Erman"
    }, 
    {
      "family": "Altingovde", 
      "given": " Ismail Sengor"
    }
  ], 
  "id": "72473", 
  "issued": {
    "date-parts": [
      [
        2019, 
        1, 
        1
      ]
    ]
  }, 
  "title": "Caching Scores for Faster Query Processing with Dynamic Pruning in Search Engines", 
  "type": "paper-conference"
}