Efficient distributed selective search |
| |
| Authors: | Yubin Kim Jamie Callan J Shane Culpepper Alistair Moffat |
| |
| Institution: | 1.Carnegie Mellon University,Pittsburgh,USA;2.RMIT University,Melbourne,Australia;3.The University of Melbourne,Melbourne,Australia |
| |
| Abstract: | Simulation and analysis have shown that selective search can reduce the cost of large-scale distributed information retrieval. By partitioning the collection into small topical shards, and then using a resource ranking algorithm to choose a subset of shards to search for each query, fewer postings are evaluated. In this paper we extend the study of selective search into new areas using a fine-grained simulation, examining the difference in efficiency when term-based and sample-based resource selection algorithms are used; measuring the effect of two policies for assigning index shards to machines; and exploring the benefits of index-spreading and mirroring as the number of deployed machines is varied. Results obtained for two large datasets and four large query logs confirm that selective search is significantly more efficient than conventional distributed search architectures and can handle higher query rates. Furthermore, we demonstrate that selective search can be tuned to avoid bottlenecks, and thus maximize usage of the underlying computer hardware. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
