Indexing Compressed Text (1997)
| Venue: | Proceedings of the 4th South American Workshop on String Processing |
| Citations: | 20 - 8 self |
BibTeX
@INPROCEEDINGS{Moura97indexingcompressed,
author = {Edleno S. De Moura and Gonzalo Navarro and Nivio Ziviani},
title = {Indexing Compressed Text},
booktitle = {Proceedings of the 4th South American Workshop on String Processing},
year = {1997},
pages = {95--111},
publisher = {Carleton University Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a technique to build an index based on suffix arrays for compressed texts. We also propose a compression scheme for textual databases based on words that generates a compression code that preserves the lexicographical ordering of the text words. As a consequence it permits the sorting of the compressed strings to generate the suffix array without decompressing. As the compressed text is under 30% of the size of the original text we are able to build the suffix array twice as fast on the compressed text. The compressed text plus index is 55-60% of the size of the original text plus index and search times are reduced to approximately half the time. We also present analytical and experimental results for different variations of the word-oriented compression paradigm.
