Suffix arrays with a twist
Data Structures and Algorithms
2016-07-28 v1
Abstract
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 how we search for the right interval boundary impacts significantly the overall search speed, a B-tree data layout easily wins over the standard one, the well-known idea of a lookup table for the prefixes of the suffixes can be refined with using compression, caching prefixes of the suffixes in a helper array can pose a(nother) practical space-time tradeoff.
Cite
@article{arxiv.1607.08176,
title = {Suffix arrays with a twist},
author = {Tomasz Kowalski and Szymon Grabowski and Kimmo Fredriksson and Marcin Raniszewski},
journal= {arXiv preprint arXiv:1607.08176},
year = {2016}
}