arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.08176cs.DS
收藏

带扭曲的后缀数组

Suffix arrays with a twist

Tomasz Kowalski, Szymon Grabowski, Kimmo Fredriksson, Marcin Raniszewski

摘要:

suffix数组是一个经典的全文索引,它结合了有效性和简单性。我们讨论了三种旨在提高其效率的方法:更改导航,数据布局和添加额外的数据。简而言之,我们表明,$(i)$如何搜索正确的间隔边界显着影响整体搜索速度,$(ii)$的B树数据布局很容易战胜标准的,$(iii)$的后缀的前缀的查找表的众所周知的想法,可以使用压缩,$(iv)$缓存前缀的后缀在一个助手数组可以构成(nother)实际的空间-时间权衡。

英文摘要:

The suffix array is a classic full-text index, combining effectiveness with simplicity. We discuss three approaches aiming to improve its efficiency even more: changes to the navigation, data layout and adding extra data. In short, we show that $(i)$ how we search for the right interval boundary impacts significantly the overall search speed, $(ii)$ a B-tree data layout easily wins over the standard one, $(iii)$ the well-known idea of a lookup table for the prefixes of the suffixes can be refined with using compression, $(iv)$ caching prefixes of the suffixes in a helper array can pose a(nother) practical space-time tradeoff.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑