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

Yafay, Erman; Altingovde, Ismail Sengor

JSON-LD (schema.org)

{
  "@context": "https://schema.org/", 
  "@id": 72473, 
  "@type": "ScholarlyArticle", 
  "creator": [
    {
      "@type": "Person", 
      "affiliation": "Middle East Tech Univ, Ankara, Turkey", 
      "name": "Yafay, Erman"
    }, 
    {
      "@type": "Person", 
      "affiliation": "Middle East Tech Univ, Ankara, Turkey", 
      "name": "Altingovde, Ismail Sengor"
    }
  ], 
  "datePublished": "2019-01-01", 
  "description": "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.", 
  "headline": "Caching Scores for Faster Query Processing with Dynamic Pruning in Search Engines", 
  "identifier": 72473, 
  "image": "https://aperta.ulakbim.gov.tr/static/img/logo/aperta_logo_with_icon.svg", 
  "license": "http://www.opendefinition.org/licenses/cc-by", 
  "name": "Caching Scores for Faster Query Processing with Dynamic Pruning in Search Engines", 
  "url": "https://aperta.ulakbim.gov.tr/record/72473"
}