• Home
  • Advanced Search
  • Directory of Libraries
  • About lib.ir
  • Contact Us
  • History
  • ورود / ثبت نام

عنوان
Compressed data structures for strings :

پدید آورنده
Rossano Venturini

موضوع
Data compression (Computer science),Data structures (Computer science)

رده
QA76
.
9
.
D33

کتابخانه
Center and Library of Islamic Studies in European Languages

محل استقرار
استان: Qom ـ شهر: Qom

Center and Library of Islamic Studies in European Languages

تماس با کتابخانه : 32910706-025

INTERNATIONAL STANDARD BOOK NUMBER

Terms of Availability and/or Price
(electronic bk.)
Terms of Availability and/or Price
(electronic bk.)
(Number (ISBN
9462390320
(Number (ISBN
9462390339
(Number (ISBN
9789462390324
(Number (ISBN
9789462390331
Erroneous ISBN
9789462390324

NATIONAL BIBLIOGRAPHY NUMBER

Number
b435744

TITLE AND STATEMENT OF RESPONSIBILITY

Title Proper
Compressed data structures for strings :
General Material Designation
[Book]
Other Title Information
on searching and extracting strings from compressed textual data /
First Statement of Responsibility
Rossano Venturini

PHYSICAL DESCRIPTION

Specific Material Designation and Extent of Item
1 online resource (xiv, 120 pages) :
Other Physical Details
illustrations

SERIES

Series Title
Atlantis Studies in Computing,
Volume Designation
volume 4
ISSN of Series
2212-8557 ;

INTERNAL BIBLIOGRAPHIES/INDEXES NOTE

Text of Note
Includes bibliographical references

CONTENTS NOTE

Text of Note
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
0

SUMMARY OR ABSTRACT

Text of 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

TOPICAL NAME USED AS SUBJECT

Data compression (Computer science)
Data structures (Computer science)

LIBRARY OF CONGRESS CLASSIFICATION

Class number
QA76
.
9
.
D33

PERSONAL NAME - PRIMARY RESPONSIBILITY

Venturini, Rossano

CORPORATE BODY NAME - ALTERNATIVE RESPONSIBILITY

Ohio Library and Information Network

ORIGINATING SOURCE

Date of Transaction
20150224074234.0
Cataloguing Rules (Descriptive Conventions))
pn

ELECTRONIC LOCATION AND ACCESS

Electronic name
 مطالعه متن کتاب 

[Book]

Y

Proposal/Bug Report

Warning! Enter The Information Carefully
Send Cancel
This website is managed by Dar Al-Hadith Scientific-Cultural Institute and Computer Research Center of Islamic Sciences (also known as Noor)
Libraries are responsible for the validity of information, and the spiritual rights of information are reserved for them
Best Searcher - The 5th Digital Media Festival