%0 Journal Article %1 citeulike:2077224 %A Billerbeck, Bodo %A Zobel, Justin %B (1) SPIRE 2004 %D 2006 %J Information Systems %K efficient, expansion, query %N 7 %P 573--584 %R 10.1016/j.is.2005.11.002 %T Efficient query expansion with auxiliary data structures %U http://dx.doi.org/10.1016/j.is.2005.11.002 %V 31 %X Query expansion is a well-known method for improving average effectiveness in information retrieval. The most effective query expansion methods rely on retrieving documents which are used as a source of expansion terms. Retrieving those documents is costly. We examine the bottlenecks of a conventional approach and investigate alternative methods aimed at reducing query evaluation time. We propose a new method that draws candidate terms from brief document summaries that are held in memory for each document. While approximately maintaining the effectiveness of the conventional approach, this method significantly reduces the time required for query expansion by a factor of 5-10.

@article{citeulike:2077224, abstract = {Query expansion is a well-known method for improving average effectiveness in information retrieval. The most effective query expansion methods rely on retrieving documents which are used as a source of expansion terms. Retrieving those documents is costly. We examine the bottlenecks of a conventional approach and investigate alternative methods aimed at reducing query evaluation time. We propose a new method that draws candidate terms from brief document summaries that are held in memory for each document. While approximately maintaining the effectiveness of the conventional approach, this method significantly reduces the time required for query expansion by a factor of 5-10.}, added-at = {2008-06-17T16:01:02.000+0200}, author = {Billerbeck, Bodo and Zobel, Justin}, biburl = {https://www.bibsonomy.org/bibtex/2e9c682bf04c08db687a8a5f735195d8c/pprett}, booktitle = {(1) SPIRE 2004}, citeulike-article-id = {2077224}, doi = {10.1016/j.is.2005.11.002}, interhash = {0176f8e81c3dd6397ca0f42e768ff1af}, intrahash = {e9c682bf04c08db687a8a5f735195d8c}, journal = {Information Systems}, keywords = {efficient, expansion, query}, month = {November}, number = 7, pages = {573--584}, posted-at = {2007-12-08 10:49:21}, priority = {2}, timestamp = {2008-06-17T16:01:36.000+0200}, title = {Efficient query expansion with auxiliary data structures}, url = {http://dx.doi.org/10.1016/j.is.2005.11.002}, volume = 31, year = 2006 }