An Experimental Study of Index Compression and DAAT Query Processing Methods
An Experimental Study of Index Compression and DAAT Query Processing Methods
复制标题
DOI：
10.1007/978-3-030-15712-8_23
复制
发表时间：
2019-04
期刊：
影响因子：
--
通讯作者：
Antonio Mallia;Michal Siedlaczek;Torsten Suel
中科院分区：
文献类型：
--
作者：
Antonio Mallia;Michal Siedlaczek;Torsten Suel
在过去的二十年里，IR社区在top-k查询处理和倒排索引压缩技术方面取得了许多进展。虽然新提出的方法通常会与几个基线进行比较，但这些评估通常非常有限，我们认为在算法和压缩方法的最佳选择上没有清晰的总体情况。在本文中，我们试图通过评估一些最先进的索引压缩方法和安全的析取DAAT查询处理算法来解决这个问题。我们的目标是了解索引压缩性能对整体查询处理速度的影响，查询处理算法的选择如何取决于所使用的压缩方法，以及文档重新排序技术和返回的结果数量如何影响性能，请记住，当前的搜索引擎通常使用数百或数千个候选人的集合进行进一步的重新排序。
In the last two decades, the IR community has seen numerous advances in top-k query processing and inverted index compression techniques. While newly proposed methods are typically compared against several baselines, these evaluations are often very limited, and we feel that there is no clear overall picture on the best choices of algorithms and compression methods. In this paper, we attempt to address this issue by evaluating a number of state-of-the-art index compression methods and safe disjunctive DAAT query processing algorithms. Our goal is to understand how much index compression performance impacts overall query processing speed, how the choice of query processing algorithm depends on the compression method used, and how performance is impacted by document reordering techniques and the number of results returned, keeping in mind that current search engines typically use sets of hundreds or thousands of candidates for further reranking.