= Jeffrey Scott Vitter
{c}
<Jeffrey Scott Vitter> coauthored the 2003 work on entropy-compressed <string>[text] indexes with <Roberto Grossi> and <Ankur Gupta>. It develops compressed suffix-array representations and introduces a <wavelet tree> representation for symbol <sequence>[sequences]. <bit vector>[Bitvectors] route a position through alphabet partitions, with <rank queries> translating that position into the selected <subsequence>. This connects compressed storage to efficient indexing rather than requiring full decompression for every <database query>[query].<High-Order Entropy-Compressed Text Indexes by Roberto Grossi and others>[abstract and §4.2]{ref}
Back to article page