A Compressed Text Index on Secondary Memory
Rodrigo González and Gonzalo Navarro
We introduce a practical disk-based compressed text index that, when the text
is compressible, takes much less space than the suffix array.
It provides very good I/O times for searching, which in particular improve
when the text is compressible. In this aspect our index is unique, as
compressed indexes have been slower than their classical counterparts on
secondary memory. We analyze our index and show experimentally that it is
extremely competitive on compressible texts.