Compressed Data Structures for Strings
| Autor: | Rossano Venturini |
|---|---|
| EAN: | 9789462390331 |
| eBook Format: | |
| Sprache: | Englisch |
| Produktart: | eBook |
| Veröffentlichungsdatum: | 31.10.2013 |
| Untertitel: | On Searching and Extracting Strings from Compressed Textual Data |
| Kategorie: | |
| Schlagworte: | Compressed data structures Data compression Dynamic programming Full-text indexing Pattern matching |
90,94 €*
Versandkostenfrei
Die Verfügbarkeit wird nach ihrer Bestellung bei uns geprüft.
Bücher sind in der Regel innerhalb von 1-2 Werktagen abholbereit.
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.
Verwandte Artikel