A Comparison of Top-k Threshold Estimation Techniques for Disjunctive Query Processing
Author:
Affiliation:
1. New York University, New York, NY, USA
2. Tsinghua University, Beijing, China
Funder
Amazon
NSF
Publisher
ACM
Link
https://dl.acm.org/doi/pdf/10.1145/3340531.3412080
Reference26 articles.
1. Static index pruning in web search engines
2. Taily
3. R. Baeza-Yates V. Murdock and C. Hauff. 2009. Efficiency Trade-Offs in Two-Tier Web Search Systems. In SIGIR. 163--170. R. Baeza-Yates V. Murdock and C. Hauff. 2009. Efficiency Trade-Offs in Two-Tier Web Search Systems. In SIGIR. 163--170.
4. A. Z. Broder D. Carmel M. Herscovici A. Soffer and J. Zien. 2003. Efficient Query Evaluation Using a Two-Level Retrieval Process. In CIKM. A. Z. Broder D. Carmel M. Herscovici A. Soffer and J. Zien. 2003. Efficient Query Evaluation Using a Two-Level Retrieval Process. In CIKM.
5. Z. Dai Y. Kim and J. Callan. 2017. Learning to rank resources. In SIGIR. 837--840. Z. Dai Y. Kim and J. Callan. 2017. Learning to rank resources. In SIGIR. 837--840.
Cited by 11 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Faster Learned Sparse Retrieval with Block-Max Pruning;Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval;2024-07-10
2. Profiling and Visualizing Dynamic Pruning Algorithms;Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval;2023-07-18
3. Faster Dynamic Pruning via Reordering of Documents in Inverted Indexes;Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval;2023-07-18
4. Many are Better than One: Algorithm Selection for Faster Top-K Retrieval;Information Processing & Management;2023-07
5. Efficient Document-at-a-Time and Score-at-a-Time Query Evaluation for Learned Sparse Representations;ACM Transactions on Information Systems;2022-12-15
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3