Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Compressed Data Structures for Strings: On Searching and Extracting Strings from Compressed Textual Data

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

Venturini, Rossano

Hardcover

Series: Atlantis Studies in Computing, Book 4

General Computers

ISBN10: 9462390320
ISBN13: 9789462390324
Publisher: Springer Nature
Published: Nov 18 2013
Pages: 118
Weight: 0.81
Height: 0.38 Width: 6.14 Depth: 9.21
Language: English
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.

Also in

General Computers

View All