Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.is.2005.11.002 | Inf. Syst. |
Keywords | Field | DocType |
query associations,well-known method,effective query expansion method,document surrogates,query evaluation time,average effectiveness,query expansion,efficient query expansion,efficiency,eciency,auxiliary data structure,conventional approach,expansion term,alternative method,new method,brief document summary,data structure,information retrieval | Query optimization,Data mining,Query language,RDF query language,Query expansion,Information retrieval,Computer science,Sargable,Web query classification,Query by Example,Ranking (information retrieval),Database | Journal |
Volume | Issue | ISSN |
31 | 7 | Information Systems |
Citations | PageRank | References |
10 | 0.63 | 34 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bodo Billerbeck | 1 | 272 | 14.24 |
| Justin Zobel | 2 | 6882 | 880.46 |