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

19
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

Collections

Department of Computer Engineering, Conference / Seminar