Compressed Data Structures for Strings
On Searching and Extracting Strings from Compressed Textual Data
(Sprache: Englisch)
This volume tackles the conflicting requirements of data compression and indexing in massive datasets, by using optimization techniques to improve compression and reconfiguring data structure to increase the efficiency, and speed, of pattern-matching queries.
Jetzt vorbestellen
versandkostenfrei
Buch (Gebunden)
54.99 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Compressed Data Structures for Strings “
This volume tackles the conflicting requirements of data compression and indexing in massive datasets, by using optimization techniques to improve compression and reconfiguring data structure to increase the efficiency, and speed, of pattern-matching queries.
Klappentext zu „Compressed Data Structures for Strings “
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.
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.
Inhaltsverzeichnis zu „Compressed Data Structures for Strings “
- 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
Bibliographische Angaben
- Autor: Rossano Venturini
- 2013, 2014, XIV, 118 Seiten, Maße: 17,2 x 24,1 cm, Gebunden, Englisch
- Verlag: Springer, Berlin
- ISBN-10: 9462390320
- ISBN-13: 9789462390324
Sprache:
Englisch
Kommentar zu "Compressed Data Structures for Strings"
Schreiben Sie einen Kommentar zu "Compressed Data Structures for Strings".
Kommentar verfassen