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

Yafay, Erman; Altingovde, Ismail Sengor

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Yafay, Erman</dc:creator>
  <dc:creator>Altingovde, Ismail Sengor</dc:creator>
  <dc:date>2019-01-01</dc:date>
  <dc: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.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/72473</dc:identifier>
  <dc:identifier>oai:zenodo.org:72473</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:title>Caching Scores for Faster Query Processing with Dynamic Pruning in Search Engines</dc:title>
  <dc:type>info:eu-repo/semantics/conferencePaper</dc:type>
  <dc:type>publication-conferencepaper</dc:type>
</oai_dc:dc>