Efficient query evaluation using a two-level retrieval process Export

@inproceedings{citeulike:2201034, abstract = {We present an efficient query evaluation method based on a two level approach: at the first level, our method iterates in parallel over query term postings and identifies candidate documents using an approximate evaluation taking into account only partial information on term occurrences and no query independent factors; at the second level, promising candidates are fully evaluated and their exact scores are computed. The efficiency of the evaluation process can be improved significantly using dynamic pruning techniques with very little cost in effectiveness. The amount of pruning can be controlled by the user as a function of time allocated for query evaluation. Experimentally, using the TREC Web Track data, we have determined that our algorithm significantly reduces the total number of full evaluations by more than 90\%, almost without any loss in precision or recall. At the heart of our approach there is an efficient implementation of a new Boolean construct called WAND or Weak AND that might be of independent interest.}, address = {New York, NY, USA}, author = {Broder, Andrei Z. and Carmel, David and Herscovici, Michael and Soffer, Aya and Zien, Jason}, booktitle = {CIKM '03: Proceedings of the twelfth international conference on Information and knowledge management}, citeulike-article-id = {2201034}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=956944}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/956863.956944}, doi = {10.1145/956863.956944}, isbn = {1-58113-723-0}, keywords = {2003, cikm, efficiency, web\_search}, location = {New Orleans, LA, USA}, pages = {426--434}, posted-at = {2009-11-06 06:22:38}, priority = {2}, publisher = {ACM}, title = {Efficient query evaluation using a two-level retrieval process}, url = {http://dx.doi.org/10.1145/956863.956944}, year = {2003} }

TY - CONF ID - citeulike:2201034 L3 - citeulike-article-id:2201034 N2 - We present an efficient query evaluation method based on a two level approach: at the first level, our method iterates in parallel over query term postings and identifies candidate documents using an approximate evaluation taking into account only partial information on term occurrences and no query independent factors; at the second level, promising candidates are fully evaluated and their exact scores are computed. The efficiency of the evaluation process can be improved significantly using dynamic pruning techniques with very little cost in effectiveness. The amount of pruning can be controlled by the user as a function of time allocated for query evaluation. Experimentally, using the TREC Web Track data, we have determined that our algorithm significantly reduces the total number of full evaluations by more than 90%, almost without any loss in precision or recall. At the heart of our approach there is an efficient implementation of a new Boolean construct called WAND or Weak AND that might be of independent interest. CY - New Orleans, LA, USA SN - 1-58113-723-0 AD - New York, NY, USA EP - 434 TI - Efficient query evaluation using a two-level retrieval process PB - ACM T2 - CIKM '03: Proceedings of the twelfth international conference on Information and knowledge management SP - 426 KW - 2003 KW - cikm KW - efficiency KW - web_search AU - Broder, Andrei AU - Carmel, David AU - Herscovici, Michael AU - Soffer, Aya AU - Zien, Jason PY - 2003/// UR - http://dx.doi.org/10.1145/956863.956944 ER -