| 書(shū)目名稱(chēng) | Compressed Data Structures for Strings |
| 副標(biāo)題 | On Searching and Ext |
| 編輯 | Rossano Venturini |
| 視頻video | http://file.papertrans.cn/232/231973/231973.mp4 |
| 概述 | Presents new results to improve data compression by solving optimization problems.Presents efficient solutions to pattern matching problems in compressed space.Nice balance of theoretical achievements |
| 叢書(shū)名稱(chēng) | Atlantis Studies in Computing |
| 圖書(shū)封面 |  |
| 描述 | 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. |
| 出版日期 | Book 2014 |
| 關(guān)鍵詞 | Compressed data structures; Data compression; Dynamic programming; Full-text indexing; Pattern matching |
| 版次 | 1 |
| doi | https://doi.org/10.2991/978-94-6239-033-1 |
| isbn_ebook | 978-94-6239-033-1Series ISSN 2212-8557 Series E-ISSN 2212-8565 |
| issn_series | 2212-8557 |
| copyright | Atlantis Press and the authors 2014 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-1-29 06:47
發(fā)表于 2025-3-21 16:44:25
