Compressed Data Structures for Strings

On Searching and Extracting Strings from Compressed Textual Data

Gebonden Engels 2013 2014e druk 9789462390324
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

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.

Specificaties

ISBN13:9789462390324
Taal:Engels
Bindwijze:gebonden
Aantal pagina's:118
Druk:2014

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Inhoudsopgave

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.

Managementboek Top 100

Rubrieken

Populaire producten

    Personen

      Trefwoorden

        Compressed Data Structures for Strings