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

Yafay, Erman; Altingovde, Ismail Sengor

DataCite XML

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/72473</identifier>
  <creators>
    <creator>
      <creatorName>Yafay, Erman</creatorName>
      <givenName>Erman</givenName>
      <familyName>Yafay</familyName>
      <affiliation>Middle East Tech Univ, Ankara, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Altingovde, Ismail Sengor</creatorName>
      <givenName>Ismail Sengor</givenName>
      <familyName>Altingovde</familyName>
      <affiliation>Middle East Tech Univ, Ankara, Turkey</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Caching Scores For Faster Query Processing With Dynamic Pruning In Search Engines</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2019</publicationYear>
  <dates>
    <date dateType="Issued">2019-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Conference paper</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/72473</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1145/3357384.3358154</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="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.</description>
  </descriptions>
</resource>