Compressed Data Structures for Strings On Searching and Extracting Strings from Compressed Textual Data /
Data compression is mandatory to manage massive datasets, indexing is fundamental to query them. However, their goals appear as counterposed: the former aims at minimizing data redundancies, whereas the latter augments the dataset with auxiliary information to speed up the query resolution. In this...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Language: | English |
| Published: |
Paris :
Atlantis Press : Imprint: Atlantis Press,
2014.
|
| Edition: | 1st ed. 2014. |
| Series: | Atlantis Studies in Computing,
4 |
| Subjects: | |
| Online Access: | https://doi.org/10.2991/978-94-6239-033-1 |
Table of Contents:
- Introduction
- Basic concepts
- Optimally partitioning a text to improve its compression
- Bit-complexity of Lempel-Ziv compression
- Fast random access on compressed data
- Experiments on compressed full-text indexing
- Dictionary indexes
- Future directions of research.