Suffix Arrays with a Twist
DOI:
https://doi.org/10.31577/cai_2019_3_555Keywords:
Suffix array, data structures, text indexes, hashingAbstract
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.Downloads
Download data is not yet available.
Downloads
Published
2019-08-01
How to Cite
Kowalski, T. M., Grabowski, S., & Fredriksson, K. (2019). Suffix Arrays with a Twist. Computing and Informatics, 38(3), 555–574. https://doi.org/10.31577/cai_2019_3_555
Issue
Section
Articles