Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Videos
Videos
Thesis submission
Thesis submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Contact us
Contact us
Caching Scores for Faster Query Processing with Dynamic Pruning in Search Engines
Date
2019-01-01
Author
Yafay, Erman
Altıngövde, İsmail Sengör
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
15
views
0
downloads
Cite This
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.
URI
https://hdl.handle.net/11511/41593
DOI
https://doi.org/10.1145/3357384.3358154
Collections
Department of Computer Engineering, Conference / Seminar
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
E. Yafay and İ. S. Altıngövde, “Caching Scores for Faster Query Processing with Dynamic Pruning in Search Engines,” 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41593.