Compressed Data Structures for Strings: On Searching and Extracting Strings from Compressed Textual Data by Rossano VenturiniCompressed Data Structures for Strings: On Searching and Extracting Strings from Compressed Textual Data by Rossano Venturini

Compressed Data Structures for Strings: On Searching and Extracting Strings from Compressed Textual…

byRossano Venturini

Hardcover | November 18, 2013

Pricing and Purchase Info

$151.95

Earn 760 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:Compressed Data Structures for Strings: On Searching and Extracting Strings from Compressed Textual…Format:HardcoverDimensions:118 pagesPublished:November 18, 2013Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:9462390320

ISBN - 13:9789462390324

Look for similar items by category:

Reviews

Table of Contents

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.