Get Free Shipping on orders over $79
Compressed Data Structures for Strings : On Searching and Extracting Strings from Compressed Textual Data - Rossano Venturini

Compressed Data Structures for Strings

On Searching and Extracting Strings from Compressed Textual Data

By: Rossano Venturini

eText | 31 October 2013

At a Glance

eText


$84.99

or 4 interest-free payments of $21.25 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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.

on
Desktop
Tablet
Mobile

More in Computer Architecture & Logic Design

Quantum Computing - Alex Wood

eBOOK

Think Distributed Systems - Dominik Tornow

eBOOK