Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Compressed Data Structures for Strings : On Searching and Extracting Strings from Compressed Textual Data, PDF eBook

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

Part of the Atlantis Studies in Computing series

PDF

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

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.

Information

Other Formats

Information