Konferans bildirisi Açık Erişim

Caching Scores for Faster Query Processing with Dynamic Pruning in Search Engines

Yafay, Erman; Altingovde, Ismail Sengor


JSON

{
  "conceptrecid": "72472", 
  "created": "2021-03-16T03:43:55.964767+00:00", 
  "doi": "10.1145/3357384.3358154", 
  "files": [
    {
      "bucket": "c1fe0dcb-6753-446a-b3ff-5743bbb380fe", 
      "checksum": "md5:0f81279b4add57149cd993555e27bb1a", 
      "key": "bib-2396a55a-77a2-41b3-b9bb-46ae91f638a3.txt", 
      "links": {
        "self": "https://aperta.ulakbim.gov.tr/api/files/c1fe0dcb-6753-446a-b3ff-5743bbb380fe/bib-2396a55a-77a2-41b3-b9bb-46ae91f638a3.txt"
      }, 
      "size": 219, 
      "type": "txt"
    }
  ], 
  "id": 72473, 
  "links": {
    "badge": "https://aperta.ulakbim.gov.tr/badge/doi/10.1145/3357384.3358154.svg", 
    "bucket": "https://aperta.ulakbim.gov.tr/api/files/c1fe0dcb-6753-446a-b3ff-5743bbb380fe", 
    "doi": "https://doi.org/10.1145/3357384.3358154", 
    "html": "https://aperta.ulakbim.gov.tr/record/72473", 
    "latest": "https://aperta.ulakbim.gov.tr/api/records/72473", 
    "latest_html": "https://aperta.ulakbim.gov.tr/record/72473"
  }, 
  "metadata": {
    "access_right": "open", 
    "access_right_category": "success", 
    "communities": [
      {
        "id": "tubitak-destekli-proje-yayinlari"
      }
    ], 
    "creators": [
      {
        "affiliation": "Middle East Tech Univ, Ankara, Turkey", 
        "name": "Yafay, Erman"
      }, 
      {
        "affiliation": "Middle East Tech Univ, Ankara, Turkey", 
        "name": "Altingovde, Ismail Sengor"
      }
    ], 
    "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.", 
    "doi": "10.1145/3357384.3358154", 
    "has_grant": false, 
    "license": {
      "id": "cc-by"
    }, 
    "meeting": {
      "title": "PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19)"
    }, 
    "publication_date": "2019-01-01", 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "72473"
          }, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "72472"
          }
        }
      ]
    }, 
    "resource_type": {
      "subtype": "conferencepaper", 
      "title": "Konferans bildirisi", 
      "type": "publication"
    }, 
    "title": "Caching Scores for Faster Query Processing with Dynamic Pruning in Search Engines"
  }, 
  "owners": [
    1
  ], 
  "revision": 1, 
  "stats": {
    "downloads": 12.0, 
    "unique_downloads": 12.0, 
    "unique_views": 38.0, 
    "version_downloads": 12.0, 
    "version_unique_downloads": 12.0, 
    "version_unique_views": 38.0, 
    "version_views": 41.0, 
    "version_volume": 2628.0, 
    "views": 41.0, 
    "volume": 2628.0
  }, 
  "updated": "2021-03-16T03:43:56.011566+00:00"
}
41
12
görüntülenme
indirilme
Görüntülenme 41
İndirme 12
Veri hacmi 2.6 kB
Tekil görüntülenme 38
Tekil indirme 12

Alıntı yap