Theory and Practice of Succinct Data Structures

• Project/Area Number: 16H02781
• Research Category: Grant-in-Aid for Scientific Research (B)
• Allocation Type: Single-year Grants
• Section: 一般
• Research Field: Theory of informatics
• Research Institution: The University of Tokyo
• Principal Investigator: SADAKANE KUNIHIKO 東京大学, 大学院情報理工学系研究科, 教授 (20323090)
• Project Period (FY): 2016-04-01 – 2021-03-31
• Project Status: Completed (Fiscal Year 2021)
• Budget Amount: ¥7,280,000 (Direct Cost: ¥5,600,000、Indirect Cost: ¥1,680,000); Fiscal Year 2020: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000); Fiscal Year 2019: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000); Fiscal Year 2018: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000); Fiscal Year 2017: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000); Fiscal Year 2016: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
• Keywords: 簡潔データ構造 / ビッグデータ / データ構造 / データ圧縮 / 並列アルゴリズム

Outline of Final Research Achievements

We developed several succinct data structures that have good performances in both theory and practice. For example, we reduced the working space for ZDD that represents set families. We also developed space-efficient data structures for multi-dimensional orthogonal range searches.

Academic Significance and Societal Importance of the Research Achievements

ビッグデータ処理で問題になるのはデータが大量にあるため計算機のメモリ上での処理が行えないということである．古典的な手法ではデータをハードディスク上に格納して処理を行うI/Oアルゴリズムを用いていた．しかしハードディスクのランダムアクセスはメモリへのアクセスとは比べ物にならないほど低速であり，ビッグデータ処理には時間がかかっていた．
簡潔データ構造では，データ構造のサイズはo(n)，つまりデータ量の劣線形となっており，データを計算機のメモリ上に格納することができ，スケーラブルなアルゴリズムが開発できる．

Research Products

• [Int'l Joint Research] University of Central Florida/University of Wisconsin/Louisiana State University(米国)
• [Int'l Joint Research] University of Waterloo(カナダ)
• [Int'l Joint Research] National Tsing Hua University, Taiwan(その他の国・地域)
• [Int'l Joint Research] NTNU(ノルウェー)
• [Int'l Joint Research] University of Pisa(イタリア)
• [Int'l Joint Research] Indian Institute of Technology Madras(インド)
• [Int'l Joint Research] Pisa University(イタリア)
• [Int'l Joint Research] University of Central Florida/University of Wisconsin - Whitewater/Louisiana State University(米国)
• [Int'l Joint Research] National Tsing Hua University(台湾)
• [Int'l Joint Research] University of Waterloo(カナダ)
• [Int'l Joint Research] TU Dortmund(ドイツ)
• [Int'l Joint Research] 香港大学(中国 (香港))
• [Int'l Joint Research] Universitat Politecnica de Valencia(スペイン)
• [Journal Article] A framework for designing space-efficient dictionaries for parameterized and order-preserving matching (2021)
  • Author(s): Ganguly Arnab、Hon Wing-Kai、Sadakane Kunihiko、Shah Rahul、Thankachan Sharma V.、Yang Yilin
  • Journal Title: Theoretical Computer Science Volume: 854 Pages: 52-62
  • DOI: 10.1016/j.tcs.2020.11.036
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Succinct Representations for (Non)Deterministic Finite Automata (2021)
  • Author(s): Chakraborty Sankardeep、Grossi Roberto、Sadakane Kunihiko、Satti Srinivasa Rao
  • Journal Title: Proceedings of LATA Volume: LNCS 12638 Pages: 55-67
  • DOI: 10.1007/978-3-030-68195-1_5
  • ISBN: 9783030681944, 9783030681951
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Succinct representations of Intersection Graphs on a Circle (2021)
  • Author(s): Acan Huseyin、Chakraborty Sankardeep、Jo Seungbum、Nakashima Kei、Sadakane Kunihiko、Satti Srinivasa Rao
  • Journal Title: Proceedigns of IEEE Data Compression Conference (DCC) Volume: IEEE Pages: 123-132
  • DOI: 10.1109/dcc50243.2021.00020
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Succinct Data Structures for Small Clique-Width Graphs (2021)
  • Author(s): Chakraborty Sankardeep、Jo Seungbum、Sadakane Kunihiko、Satti Srinivasa Rao
  • Journal Title: Proceedigns of IEEE Data Compression Conference (DCC) Volume: IEEE Pages: 133-142
  • DOI: 10.1109/dcc50243.2021.00021
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Optimal In-place Algorithms for Basic Graph Problems (2020)
  • Author(s): Chakraborty Sankardeep、Sadakane Kunihiko、Satti Srinivasa Rao
  • Journal Title: Proceedings of IWOCA 2020 Volume: LNCS 12126 Pages: 126-139
  • DOI: 10.1007/978-3-030-48966-3_10
  • ISBN: 9783030489656, 9783030489663
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Storing Set Families More Compactly with Top ZDDs (2020)
  • Author(s): Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane
  • Journal Title: Proceedings of SEA Volume: LIPIcs 160
  • Peer Reviewed / Open Access
• [Journal Article] Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP (2020)
  • Author(s): Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, Masakazu Tateshita
  • Journal Title: Proceedings of CPM Volume: LIPIcs 161
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] A linear-space data structure for range-LCP queries in poly-logarithmic time (2020)
  • Author(s): Abedin Paniz、Ganguly Arnab、Hon Wing-Kai、Matsuda Kotaro、Nekrich Yakov、Sadakane Kunihiko、Shah Rahul、Thankachan Sharma V.
  • Journal Title: Theoretical Computer Science Volume: 822 Pages: 15-22
  • DOI: 10.1016/j.tcs.2020.04.009
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Compact and succinct data structures for multidimensional orthogonal range searching (2020)
  • Author(s): Ishiyama Kazuki、Sadakane Kunihiko
  • Journal Title: Information and Computation Volume: 273 Pages: 104519-104519
  • DOI: 10.1016/j.ic.2020.104519
  • Peer Reviewed
• [Journal Article] Enumerating Range Modes (2020)
  • Author(s): Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
  • Journal Title: Proceedings of ISAAC Volume: LIPIcs 181
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Indexing Graph Search Trees and Applications (2019)
  • Author(s): Sankardeep Chakraborty, Kunihiko Sadakane
  • Journal Title: Proceedings of 44th International Symposium on Mathematical Foundations of Computer Science (MFCS) Volume: LIPIcs 138
  • Peer Reviewed / Open Access
• [Journal Article] Faster algorithms for shortest path and network flow based on graph decomposition (2019)
  • Author(s): Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane
  • Journal Title: Journal of Graph Algorithms and Applications Volume: 23 Issue: 5 Pages: 781-813
  • DOI: 10.7155/jgaa.00512
  • Peer Reviewed / Open Access
• [Journal Article] Storing Partitions of Integers in Sublinear Space (2019)
  • Author(s): Kentaro Sumigawa, Kunihiko Sadakane
  • Journal Title: The Review of Socionetwork Strategies Volume: 13 Issue: 2 Pages: 237-252
  • DOI: 10.1007/s12626-019-00044-2
  • Peer Reviewed
• [Journal Article] Space-Efficient Fully Dynamic DFS in Undirected Graphs (2019)
  • Author(s): Nakamura Kengo, Sadakane Kunihiko
  • Journal Title: Algorithms Volume: 12 Issue: 3 Pages: 52-52
  • DOI: 10.3390/a12030052
  • Peer Reviewed / Open Access
• [Journal Article] An Efficient Representation of Partitions of Integers (2018)
  • Author(s): Kentaro Sumigawa and Kunihiko Sadakane
  • Journal Title: Proceedings of IWOCA Volume: LNCS 10979 Pages: 361-373
  • DOI: 10.1007/978-3-319-94667-2_30
  • ISBN: 9783319946665, 9783319946672
  • Peer Reviewed
• [Journal Article] A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time (2018)
  • Author(s): Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Yakov Nekrich, Rahul Shah, Sharma V. Thankachan, Kunihiko Sadakane
  • Journal Title: Proceedings of COCOON Volume: LNCS 10976 Pages: 615-625
  • DOI: 10.1007/978-3-319-94776-1_51
  • ISBN: 9783319947754, 9783319947761
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Node Similarity with q -Grams for Real-World Labeled Networks (2018)
  • Author(s): Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno
  • Journal Title: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining Volume: KDD '18 Pages: 1282-1291
  • DOI: 10.1145/3219819.3220085
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] "DenseZDD: A Compact and Fast Index for Families of Sets" (2018)
  • Author(s): Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, and Kunihiko Sadakane
  • Journal Title: Algorithms Volume: Vol.11, No.8 Issue: 8 Pages: 1-23
  • DOI: 10.3390/a11080128
  • NAID: 120006659589
  • Peer Reviewed / Open Access
• [Journal Article] A Succinct Data Structure for Multidimensional Orthogonal Range Searching (2017)
  • Author(s): Kazuki Ishiyama, Kunihiko Sadakane
  • Journal Title: Proceedings of 2017 Data Compression Conference (DCC 2017) Volume: DCC 2017 Pages: 270-279
  • DOI: 10.1109/dcc.2017.47
  • Peer Reviewed
• [Journal Article] Compression with the tudocomp Framework (2017)
  • Author(s): Patrick Dinklage, Johannes Fischer, Dominik K_ppl, Marvin L_bel, Kunihiko Sadakane
  • Journal Title: Proveedings of the 16th International Symposium on Experimental Algorithms (SEA 2017), LIPICS Volume: 75
  • DOI: 10.4230/LIPIcs.SEA.2017.13
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Practical Space-Efficient Data Structures for High-Dimensional Orthogonal Range Searching (2017)
  • Author(s): Kazuki Ishiyama, Kunihiko Sadakane
  • Journal Title: Proceedings of the 10th International Conference on Similarity Search and Applications (SISAP 2017), Lecture Notes in Computer Science Volume: 10609 Pages: 234-246
  • DOI: 10.1007/978-3-319-68474-1_16
  • ISBN: 9783319684734, 9783319684741
  • Peer Reviewed
• [Journal Article] Succinct Quadtrees for Road Data (2017)
  • Author(s): Kazuki Ishiyama, Koji Kobayashi, Kunihiko Sadakane
  • Journal Title: Proceedings of the 10th International Conference on Similarity Search and Applications (SISAP 2017), Lecture Notes in Computer Science Volume: 10609 Pages: 262-272
  • DOI: 10.1007/978-3-319-68474-1_18
  • ISBN: 9783319684734, 9783319684741
  • Peer Reviewed
• [Journal Article] Engineering Hybrid DenseZDDs (2016)
  • Author(s): Taito Lee, Shuhei Denzumi, Kunihiko Sadakane
  • Journal Title: Proceedings of SEA Volume: LNCS 9685 Pages: 201-216
  • DOI: 10.1007/978-3-319-38851-9_14
  • ISBN: 9783319388502, 9783319388519
  • Peer Reviewed
• [Journal Article] Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing (2016)
  • Author(s): TakuyaTakagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
  • Journal Title: Lecture Notes in Computer Science, Springer Volume: Vol.9843 Pages: 213-225
  • DOI: 10.1007/978-3-319-44543-4_17
  • NAID: 130006038281
  • ISBN: 9783319445427, 9783319445434
  • Peer Reviewed / Open Access
• [Journal Article] Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching (2016)
  • Author(s): Arnab Ganguly, Wing-Kai Hon, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan, Yilin Yang
  • Journal Title: CPM 2016 Volume: - Pages: 1-12
  • DOI: 10.4230/LIPIcs.CPM.2016.2
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Pair-End Inexact Mapping on Hybrid GPU Environments and Out-Of-Core Indexes (2016)
  • Author(s): Jose Salavert Torres, Andres Tomas, Ignacio Medina, Kunihiko Sadakane, Ignacio Blanquer
  • Journal Title: Current Bioinformatics Volume: 11(4) Issue: 4 Pages: 459-469
  • DOI: 10.2174/1574893611666160212235359
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] MEGAHIT v1.0: A Fast and Scalable Metagenome Assembler driven by Advanced Methodologies and Community Practices (2016)
  • Author(s): Dinghua Li, Ruibang Luo, Chi-Man Liu, Chi-Ming Leung, Hing-Fung Ting, Kunihiko Sadakane, Hiroshi Yamashita, Tak-Wah Lam
  • Journal Title: Methods Volume: 102 Pages: 3-11
  • DOI: 10.1016/j.ymeth.2016.02.020
  • Peer Reviewed / Int'l Joint Research
• [Book] 簡潔データ構造 (2018)
  • Author(s): 定兼 邦彦
  • Total Pages: 232
  • Publisher: 共立出版
  • ISBN: 9784320121744
• [Remarks] Kunihiko Sadakane
  • URL: https://researchmap.jp/sada/
• [Remarks]
  • URL: https://researchmap.jp/sada/