Logo - springer
Slogan - springer

Computer Science - Hardware | Compressed Data Structures for Strings - On Searching and Extracting Strings from Compressed Textual

Compressed Data Structures for Strings

On Searching and Extracting Strings from Compressed Textual Data

Venturini, Rossano

2014, XIV, 118 p. 18 illus.

A product of Atlantis Press
Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$79.99

(net) price for USA

ISBN 978-94-6239-033-1

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$109.00

(net) price for USA

ISBN 978-94-6239-032-4

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Presents new results to improve data compression by solving optimization problems
  • Presents efficient solutions to pattern matching problems in compressed space
  • Nice balance of theoretical achievements and algorithm-engineering results for compressed data structures
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.

Content Level » Research

Keywords » Compressed data structures - Data compression - Dynamic programming - Full-text indexing - Pattern matching

Related subjects » Hardware

Table of contents / Preface / Sample pages 

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Arithmetic and Logic Structures.