摘要：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) the way 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 another practical space-time tradeoff.
其他摘要：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) the way 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 another practical space-time tradeoff.
关键词：Suffix array; data structures; text indexes; hashing
其他关键词：Suffix array; data structures; text indexes; hashing
