A machine learning approach for result caching in web search engines
Date
2017Source Title
Information Processing and Management
Print ISSN
0306-4573
Publisher
Elsevier
Volume
53
Issue
4
Pages
834 - 850
Language
English
Type
ArticleItem Usage Stats
271
views
views
359
downloads
downloads
Abstract
A commonly used technique for improving search engine performance is result caching. In result caching, precomputed results (e.g., URLs and snippets of best matching pages) of certain queries are stored in a fast-access storage. The future occurrences of a query whose results are already stored in the cache can be directly served by the result cache, eliminating the need to process the query using costly computing resources. Although other performance metrics are possible, the main performance metric for evaluating the success of a result cache is hit rate. In this work, we present a machine learning approach to improve the hit rate of a result cache by facilitating a large number of features extracted from search engine query logs. We then apply the proposed machine learning approach to static, dynamic, and static-dynamic caching. Compared to the previous methods in the literature, the proposed approach improves the hit rate of the result cache up to 0.66%, which corresponds to 9.60% of the potential room for improvement. © 2017 Elsevier Ltd
Keywords
Feature-based cachingMachine learning
Query result caching
Static caching
Static-dynamic caching
Artificial intelligence
Information retrieval
Search engines
Feature-based
Machine learning approaches
Performance metrics
Query results
Search engine performance
Static dynamics
Learning systems