Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Display
Catalogue Display
Compressed Data Structures for Strings: On Searching and Extracting Strings from Compressed Textual Data
.
Bookmark this Record
Catalogue Record 29636
.
.
Author info on Wikipedia
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 29636
.
Reviews
Catalogue Record 29636
.
British Library
Resolver for RSN-29636
Google Scholar
Resolver for RSN-29636
WorldCat
Resolver for RSN-29636
Catalogo Nazionale SBN
Resolver for RSN-29636
GoogleBooks
Resolver for RSN-29636
ICTP Library
Resolver for RSN-29636
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
004
Title
Compressed Data Structures for Strings ([Ebook]) : On Searching and Extracting Strings from Compressed Textual Data / by Rossano Venturini.
Author
Venturini, Rossano
Other name(s)
SpringerLink (Online service)
Publication
Paris Atlantis Press 2014.
Physical Details
XIV, 118 pages: 18 illus. : online resource.
ISBN
9789462390331
Summary Note
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.:
Contents note
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.
System details note
Online access to this digital book is restricted to subscription institutions and access ia available through IP address (only for SISSA internal users)
Internet Site
http://dx.doi.org/10.2991/978-94-6239-033-1
Links to Related Works
Subject References:
Arithmetic and Logic Structures
.
Computer Science
.
Authors:
Venturini, Rossano
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
Atlantis Studies in Computing
.
Classification:
004
.
004 (DDC 23)
.
.
ISBD Display
Catalogue Record 29636
.
Tag Display
Catalogue Record 29636
.
Related Works
Catalogue Record 29636
.
Marc XML
Catalogue Record 29636
.
Add Title to Basket
Catalogue Record 29636
.
Catalogue Information 29636
Beginning of record
.
Catalogue Information 29636
Top of page
.
Download Title
Catalogue Record 29636
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
29636
1
29636
-
2
29636
-
3
29636
-
4
29636
-
5
29636
-
Quick Search
Search for