02755nam 22005295 450 991030014310332120250717133506.09789462390331946239033910.2991/978-94-6239-033-1(OCoLC)880438218(MiFhGG)GVRL6WPO(CKB)3710000000058409(MiAaPQ)EBC1592495(MiFhGG)9789462390331(DE-He213)978-94-6239-033-1(EXLCZ)99371000000005840920131031d2014 u| 0engurun|---uuuuatxtccrCompressed Data Structures for Strings On Searching and Extracting Strings from Compressed Textual Data /by Rossano Venturini1st ed. 2014.Paris :Atlantis Press :Imprint: Atlantis Press,2014.1 online resource (xiv, 118 pages) illustrationsAtlantis Studies in Computing,2212-8565 ;4"ISSN: 2212-8557."9789462390324 9462390320 Includes bibliographical references.Introduction -- Basic concepts -- Optimally partitioning a text to improve its compression -- Bit-complexity of Lempel-Ziv compression -- Fast random access on compressed data -- Experiments on compressed full-text indexing -- Dictionary indexes -- Future directions of research.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.Atlantis Studies in Computing,2212-8565 ;4Computer arithmetic and logic unitsArithmetic and Logic StructuresComputer arithmetic and logic units.Arithmetic and Logic Structures.005.746Venturini Rossanoauthttp://id.loc.gov/vocabulary/relators/aut721173MiFhGGMiFhGGBOOK9910300143103321Compressed data structures for strings1410014UNINA