Caching Scores For Faster Query Processing With Dynamic Pruning In Search Engines
| Autor: | Ismail Sengor Altingovde, Erman Yafay |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Hardware_MEMORYSTRUCTURES
business.industry Computer science InformationSystems_INFORMATIONSTORAGEANDRETRIEVAL 02 engineering and technology Machine learning computer.software_genre Search engine 020204 information systems 0202 electrical engineering electronic engineering information engineering Pruning (decision trees) Artificial intelligence Cache business Heuristics computer |
| Zdroj: | CIKM |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|