用于灵活Top-k检索的紧凑索引
Compact Indexes for Flexible Top-k Retrieval
摘要：
我们设计了一个基于自索引的检索系统，能够对top-k查询进行排名安全的评估。该框架概括了Culpepper等人（ESA 2010）的GREEDY方法来处理多项查询，包括短语。我们提出了两种技术，显着减少了广泛的流行的信息检索（IR）的相关性措施，如TFxIDF和BM 25的排名时间。首先，我们根据文档权重对文档数组中的元素进行重新排序。其次，我们引入了重复数组，它将Sadakane（JDA 2007）的文档频率结构推广到文档子集。结合文档和重复数组，我们实现了有吸引力的功能空间的权衡。我们提供了一个广泛的评估，我们的系统上TB大小的IR集合。
英文摘要：
We engineer a self-index based retrieval system capable of rank-safe evaluation of top-k queries. The framework generalizes the GREEDY approach of Culpepper et al. (ESA 2010) to handle multi-term queries, including over phrases. We propose two techniques which significantly reduce the ranking time for a wide range of popular Information Retrieval (IR) relevance measures, such as TFxIDF and BM25. First, we reorder elements in the document array according to document weight. Second, we introduce the repetition array, which generalizes Sadakane's (JDA 2007) document frequency structure to document subsets. Combining document and repetition array, we achieve attractive functionality-space trade-offs. We provide an extensive evaluation of our system on terabyte-sized IR collections.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
