Compressed Data Structures for Strings: On Searching and Extracting Strings from Compressed Textual Data

✍ Scribed by Rossano Venturini (auth.)

• Publisher: Atlantis Press
• Year: 2014
• Tongue: English
• Leaves: 131
• Series: Atlantis Studies in Computing 4
• Edition: 1
• Category: Library

✦ Synopsis

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 monograph we introduce solutions that overcome this dichotomy. We start by presenting the use of optimization techniques to improve the compression of classical data compression algorithms, then we move to the design of compressed data structures providing fast random access or efficient pattern matching queries on the compressed dataset. These theoretical studies are supported by experimental evidences of their impact in practical scenarios.

✦ Table of Contents

Front Matter....Pages i-xiv
Introduction....Pages 1-4
Basic Concepts....Pages 5-14
Optimally Partitioning a Text to Improve Its Compression....Pages 15-31
Bit-Complexity of Lempel-Ziv Compression....Pages 33-54
Fast Random Access on Compressed Data....Pages 55-60
Experiments on Compressed Full-Text Indexing....Pages 61-88
Dictionary Indexes....Pages 89-106
Future Directions of Research....Pages 107-110
Back Matter....Pages 111-118

✦ Subjects

Arithmetic and Logic Structures