Window Navigation with Adaptive Probing for Executing BlockMax WAND

Research and Development in Information Retrieval(2021)

引用 4|浏览13
暂无评分
摘要
ABSTRACTBlockMax WAND (BMW) and its variants can effectively prune low-scoring documents for fast top-k disjunctive query processing. This paper studies a boosting approach that further accelerates document retrieval by executing BMW, or one of its variants, on a sequence of posting windows with an order prioritized to tighten the threshold bound earlier. This optimization could add benefits to safely eliminate more operations involved in posting block visitation and document score evaluation. This paper evaluates such index navigation for BMW and two of its variants.
更多
查看译文
关键词
Top-k Query Evaluation, Dynamic Pruning, Efficiency
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要