Running Time Prediction for Web Search Queries

Abstract

Large scale Web search engines have to process thousands of queries per second and each query has to be solved within a fraction of a second. To achieve this goal, search engines rely on sophisticated services capable of processing large amounts of data. One of these services is the search service (or index service) which is in charge of computing the top-k document results for user queries. Predicting in advance the response time of queries has practical applications in efficient administration of hardware resources assigned to query processing. In this paper, we propose and evaluate a query running time prediction algorithm that is based on a discrete Fourier transform which models the index as a collection of signals to obtain patterns. Results show that our approach performs at least as effectively as well-known prediction algorithms in the literature, while significantly improving computational efficiency.