Development of Practical Succinct Data Structures with Application to Huge Data
| Project/Area Number |
19680001
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (A)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Kyushu University |
|---|
Principal Investigator |
SADAKANE Kunihiko Kyushu University, 情報学プリンシプル研究系, 准教授 (20323090)
|
|---|
| Project Period (FY) |
2007 – 2010
|
| Project Status |
Completed (Fiscal Year 2010)
|
| Budget Amount *help |
¥18,980,000 (Direct Cost: ¥14,600,000、Indirect Cost: ¥4,380,000)
Fiscal Year 2010: ¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2009: ¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2008: ¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2007: ¥5,980,000 (Direct Cost: ¥4,600,000、Indirect Cost: ¥1,380,000)
|
|---|
| Keywords | データ圧縮 / 情報検索 / 文字列検索 / 簡潔データ構造 / 接尾辞配列 / 接尾辞木 / 圧縮接尾辞配列 / 順序木 / アルゴリズム理論 / データ構造 |
|---|
| Research Abstract |
There had been only theoretical researches on succinct data structures. In this research, we have developed succinct data structures which solve the problems of using them on actual computers. For ordinal trees, we have reduced the size of succinct data structures by 40%, while supporting various operations which had not been supported in existing data structures. We have also created a library of compressed suffix arrays and compressed suffix trees, which are succinct data structures for string searches. By using it, we can reduce the size of the data structure, which is used for searching text data of 110 Gigabytes, from 680 Gigabytes to 22 Gigabytes.
|
Report
(6 results)
Research Products
(47 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] 動的簡潔順序木2009
Author(s)
定兼邦彦
Organizer
電子情報通信学会コンピュテーション研究会
Place of Presentation
京都大学
Year and Date
2009-04-17
Related Report
-
-
-
-
-
-
-
