%0 Journal Article %1 shokouhi2007using %A Shokouhi, Milad %A Zobel, Justin %A Tahaghoghi, Saied %A Scholer, Falk %D 2007 %I Elsevier %J Information Processing & Management %K DistributedSystems IR QueryLogs %N 1 %P 169--180 %R 10.1016/j.ipm.2006.04.003 %T Using query logs to establish vocabularies in distributed information retrieval %V 43 %X Users of search engines express their needs as queries, typically consisting of a small number of terms. The resulting search engine query logs are valuable resources that can be used to predict how people interact with the search system. In this paper, we introduce two novel applications of query logs, in the context of distributed information retrieval. First, we use query log terms to guide sampling from uncooperative distributed collections. We show that while our sampling strategy is at least as efficient as current methods, it consistently performs better. Second, we propose and evaluate a pruning strategy that uses query log information to eliminate terms. Our experiments show that our proposed pruning method maintains the accuracy achieved by complete indexes, while decreasing the index size by up to 60%. While such pruning may not always be desirable in practice, it provides a useful benchmark against which other pruning strategies can be measured.

@article{shokouhi2007using, abstract = {Users of search engines express their needs as queries, typically consisting of a small number of terms. The resulting search engine query logs are valuable resources that can be used to predict how people interact with the search system. In this paper, we introduce two novel applications of query logs, in the context of distributed information retrieval. First, we use query log terms to guide sampling from uncooperative distributed collections. We show that while our sampling strategy is at least as efficient as current methods, it consistently performs better. Second, we propose and evaluate a pruning strategy that uses query log information to eliminate terms. Our experiments show that our proposed pruning method maintains the accuracy achieved by complete indexes, while decreasing the index size by up to 60%. While such pruning may not always be desirable in practice, it provides a useful benchmark against which other pruning strategies can be measured.}, added-at = {2018-06-08T20:12:20.000+0200}, author = {Shokouhi, Milad and Zobel, Justin and Tahaghoghi, Saied and Scholer, Falk}, biburl = {https://www.bibsonomy.org/bibtex/2e65bfa1590b88309b26d8aa9244df3c9/vngudivada}, doi = {10.1016/j.ipm.2006.04.003}, interhash = {2cb4d13119d299ac19f83e432f0ab4b1}, intrahash = {e65bfa1590b88309b26d8aa9244df3c9}, journal = {Information Processing {\&} Management}, keywords = {DistributedSystems IR QueryLogs}, month = jan, number = 1, pages = {169--180}, publisher = {Elsevier}, timestamp = {2019-03-25T17:06:11.000+0100}, title = {Using query logs to establish vocabularies in distributed information retrieval}, volume = 43, year = 2007 }