Query forwarding in geographically distributed search engines
SIGIR 2010 Proceedings - 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/28554
Query forwarding is an important technique for preserving the result quality in distributed search engines where the index is geographically partitioned over multiple search sites. The key component in query forwarding is the thresholding algorithm by which the forwarding decisions are given. In this paper, we propose a linear-programming-based thresholding algorithm that significantly outperforms the current state-of-the-art in terms of achieved search efficiency values. Moreover, we evaluate a greedy heuristic for partial index replication and investigate the impact of result cache freshness on query forwarding performance. Finally, we present some optimizations that improve the performance further, under certain conditions. We evaluate the proposed techniques by simulations over a real-life setting, using a large query log and a document collection obtained from Yahoo!. © 2010 ACM.
- Conference Paper 
Showing items related by title, author, creator and subject.
Altingovde I.S.; Blanco, R.; Cambazoglu, B.B.; Ozcan, R.; Sarigil, E.; Ulusoy Ö. (2012)Despite the continuous efforts to improve the web search quality, a non-negligible fraction of user queries end up with very few or even no matching results in leading web search engines. In this work, we provide a detailed ...
Multiple instance learning for re-ranking of web image search results [Görsel arama sonuçlarinin çoklu örnekle öǧrenme yöntemi̇yle yeni̇den siralanmasi] Şener F.; Cinbiş, N.I.; Şahin P.D. (2012)In this study, we propose a weakly-supervised multiple instance learning (MIL) method to improve the results of text-based image search engines. In this approach, ranked image list of search engine for a keyword query is ...
Gezici, S. (2009)In this paper, mean acquisition time (MAT) analysis of fixed-step serial search (FSSS) algorithms is presented. First, it is shown that the MAT of an FSSS algorithm can be obtained from that of a conventional serial search ...