Algorithms, Experimentation
BibTeX
@MISC{Ding_algorithms,experimentation,
author = {Shuai Ding and Ricardo Baeza-yates and Josh Attenberg and Torsten Suel},
title = {Algorithms, Experimentation},
year = {}
}
OpenURL
Abstract
per day. Most of these queries are interactive in nature, requiring a response in fractions of a second. However, there are alsoanumberofimportantscenarios where large batches of queries are submitted for various web mining and system optimization tasks that do not require an immediate response. Giventhesignificantcost ofexecutingsearchqueries over billions of web pages, it is a natural question to ask if such batches of queries can be more efficiently executed than interactive queries. In this paper, we motivate and discuss the problem of batchqueryprocessinginsearchengines, identifybasicmechanisms for improving the performance of such queries, and provide a preliminary experimental evaluation of the proposed techniques. Our conclusion is that significant cost reductions are possible by using specialized mechanisms for executing batch queries in Web search engines.







