假人FM指数
FM-index for dummies
摘要：
FM索引是一种著名的用于全文模式检索的压缩数据结构。在第一波对其理论发展的兴趣之后，我们可以观察到在过去几年中对实际FM指数变体的兴趣激增。这些增强通常与位向量表示相关，并通过有效的秩处理数据结构进行增强。在这项工作中，我们提出了一个新的，高速缓存友好，实现的排名原语和倡导一个非常简单的架构的FM索引，它的贸易压缩比的速度。实验结果表明，我们的变体比已知的最快的变体快2- 3倍，而代价是使用通常1.5- 5倍的空间。
英文摘要：
The FM-index is a celebrated compressed data structure for full-text pattern searching. After the first wave of interest in its theoretical developments, we can observe a surge of interest in practical FM-index variants in the last few years. These enhancements are often related to a bit-vector representation, augmented with an efficient rank-handling data structure. In this work, we propose a new, cache-friendly, implementation of the rank primitive and advocate for a very simple architecture of the FM-index, which trades compression ratio for speed. Experimental results show that our variants are 2--3 times faster than the fastest known ones, for the price of using typically 1.5--5 times more space.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
