Hybrid query scheduling for a replicated search engine

Freire, A., Macdonald, C. , Tonellotto, N., Ounis, I. and Cacheda, F. (2013) Hybrid query scheduling for a replicated search engine. In: 35th European Conference on Information Retrieval (ECIR 2013), Moscow, Russia, 24-27 Mar 2013, pp. 435-446. (doi: 10.1007/978-3-642-36973-5_37)

Abstract

Search engines use replication and distribution of large indices across many query servers to achieve efficient retrieval. Under high query load, queries can be scheduled to replicas that are expected to be idle soonest, facilitated by the use of predicted query response times. However, the overhead of making response time predictions can hinder the usefulness of query scheduling under low query load. In this paper, we propose a hybrid scheduling approach that combines the scheduling methods appropriate for both low and high load conditions, and can adapt in response to changing conditions. We deploy a simulation framework, which is prepared with actual and predicted response times for real Web search queries for one full day. Our experiments using different numbers of shards and replicas of the 50 million document ClueWeb09 corpus show that hybrid scheduling can reduce the average waiting times of one day of queries by 68% under high load conditions and by 7% under low load conditions w.r.t. traditional scheduling methods.

• Item Type: Conference Proceedings
• Additional Information: ISBN: 9783642369728
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Macdonald, Professor Craig and Ounis, Professor Iadh
• Authors: Freire, A., Macdonald, C., Tonellotto, N., Ounis, I., and Cacheda, F.
• Subjects: Q Science > QA Mathematics > QA76 Computer software
• College/School: College of Science and Engineering > School of Computing Science
• ISSN: 0302-9743