Rossano Venturini 
Compressed Data Structures for Strings [PDF ebook] 
On Searching and Extracting Strings from Compressed Textual Data

Support

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.

€53.49
méthodes de payement

Table des matières

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.

Achetez cet ebook et obtenez-en 1 de plus GRATUITEMENT !
Langue Anglais ● Format PDF ● Pages 118 ● ISBN 9789462390331 ● Taille du fichier 2.4 MB ● Âge 02-99 ans ● Maison d’édition Atlantis Press ● Lieu Paris ● Pays NL ● Publié 2013 ● Téléchargeable 24 mois ● Devise EUR ● ID 4621824 ● Protection contre la copie DRM sociale

Plus d’ebooks du même auteur(s) / Éditeur

16 795 Ebooks dans cette catégorie