Compressed data structures for strings [electronic resource] : on searching and extracting strings from compressed textual data / Rossano Venturini.
2014
QA76.9.D33
Linked e-resources
Linked Resource
Online Access
Details
Title
Compressed data structures for strings [electronic resource] : on searching and extracting strings from compressed textual data / Rossano Venturini.
Author
Venturini, Rossano, author.
ISBN
9789462390331 electronic book
9462390339 electronic book
9789462390324
9462390339 electronic book
9789462390324
Published
[Paris] : Atlantis Press, 2014.
Language
English
Description
1 online resource (xiv, 120 pages) : illustrations.
Item Number
10.2991/978-94-6239-033-1 doi
Call Number
QA76.9.D33
Dewey Decimal Classification
005.74/6
Summary
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.
Bibliography, etc. Note
Includes bibliographical references.
Access Note
Access limited to authorized users.
Source of Description
Description based on online resource; title from PDF title page (SpringerLink, viewed November 4, 2013).
Series
Atlantis studies in computing ; v.4. 2212-8557
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
All Resources
Table of Contents
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.
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.