che-chandler.de
Compressed Data Structures for Strings
On Searching and Extracting Strings from Compressed Textual Data
HC runder Rücken kaschiert
Sofort lieferbar | Lieferzeit: Sofort lieferbar I
Alle Preise inkl. MwSt. | Versandkostenfrei
ISBN-13:
9789462390324
Veröffentl:
2013
Einband:
HC runder Rücken kaschiert
Erscheinungsdatum:
18.11.2013
Seiten:
132
Autor:
Rossano Venturini
Gewicht:
371 g
Format:
241x160x13 mm
Serie:
4, Atlantis Studies in Computing
Sprache:
Englisch
Beschreibung:
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.
Presents new results to improve data compression by solving optimization problems
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.
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.