Top-k Query Processing with Conditional Skips
Top-k Query Processing with Conditional Skips
复制标题
具有条件跳过的 Top-k 查询处理
DOI：
10.1145/3041021.3054191
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Guy Golan
中科院分区：
文献类型：
--
作者：
Edward Bortnikov;David Carmel;Guy Golan
这项工作提高了效率的动态修剪算法，通过引入一个新的张贴迭代器，可以跳过大部分的匹配文档在top-k查询处理。也就是说，条件跳过迭代器跳转到目标文档，同时跳过目标之前不属于最终结果列表的所有匹配文档。我们的实验与新的迭代器的两个实现，并表明，将其集成到代表性的动态修剪算法，如MaxScore，WAND，和块最大WAND（宝马），降低了文档评分开销，并最终查询延迟。
This work improves the efficiency of dynamic pruning algorithms by introducing a new posting iterator that can skip large parts of the matching documents during top-k query processing. Namely, the conditional-skip iterator jumps to a target document while skipping all matching documents preceding the target that cannot belong to the final result list. We experiment with two implementations of the new iterator, and show that integrating it into representative dynamic pruning algorithms such as MaxScore, WAND, and Block Max WAND (BMW), reduces the document scoring overhead, and eventually the query latency.