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...
Κύριος συγγραφέας: | |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Paris :
Atlantis Press : Imprint: Atlantis Press,
2014.
|
Σειρά: | Atlantis Studies in Computing,
4 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.