Compressed Data Structures for Strings, 1st Edition

  • Published By:
  • ISBN-10: 9462390339
  • ISBN-13: 9789462390331
  • DDC: 005.746
  • Grade Level Range: College Freshman - College Senior
  • 118 Pages | eBook
  • Original Copyright 2014 | Published/Released June 2014
  • This publication's content originally published in print form: 2014

  • Price:  Sign in for price



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.

Table of Contents

Front Cover.
Other Frontmatter.
Other Frontmatter.
Title Page.
Copyright Page.
1: Introduction.
2: Basic Concepts.
3: Optimally Partitioning a Text to Improve Its Compression.
4: Bit-Complexity of Lempel-Ziv Compression.
5: Fast Random Access on Compressed Data.
6: Experiments on Compressed Full-Text Indeexing.
7: Dictionary Indexes.
8: Future Directions of Research.