<電子ブック>
Compressed Data Structures for Strings : On Searching and Extracting Strings from Compressed Textual Data / by Rossano Venturini
(Atlantis Studies in Computing. ISSN:22128565 ; 4)
版 | 1st ed. 2014. |
---|---|
出版者 | (Paris : Atlantis Press : Imprint: Atlantis Press) |
出版年 | 2014 |
本文言語 | 英語 |
大きさ | XIV, 118 p. 18 illus : online resource |
著者標目 | *Venturini, Rossano author SpringerLink (Online service) |
件 名 | LCSH:Computer arithmetic and logic units FREE:Arithmetic and Logic Structures |
一般注記 | 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 HTTP:URL=https://doi.org/10.2991/978-94-6239-033-1 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9789462390331 |
|
電子リソース |
|
EB00233096 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:QA76.9.C62 DC23:004.01513 |
書誌ID | 4000117378 |
ISBN | 9789462390331 |
類似資料
この資料の利用統計
このページへのアクセス回数:2回
※2017年9月4日以降