Compressed Data Structures for Strings

On Searching and Extracting Strings from Compressed Textual Data

  • Rossano┬áVenturini

Part of the Atlantis Studies in Computing book series (ATLANTISCOMP, volume 4)

Table of contents

  1. Front Matter
    Pages i-xiv
  2. Rossano Venturini
    Pages 1-4
  3. Rossano Venturini
    Pages 5-14
  4. Rossano Venturini
    Pages 33-54
  5. Rossano Venturini
    Pages 55-60
  6. Rossano Venturini
    Pages 61-88
  7. Rossano Venturini
    Pages 89-106
  8. Rossano Venturini
    Pages 107-110
  9. Back Matter
    Pages 111-118

About this book


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.


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

Authors and affiliations

  • Rossano┬áVenturini
    • 1
  1. 1.Department of Computer ScienceUniversity of PisaPisaItaly

Bibliographic information

  • DOI
  • Copyright Information Atlantis Press and the authors 2014
  • Publisher Name Atlantis Press, Paris
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-94-6239-032-4
  • Online ISBN 978-94-6239-033-1
  • Series Print ISSN 2212-8557
  • Series Online ISSN 2212-8565
  • About this book