Research on Asymptotically Succinct BDD Data Structures

2014 Fiscal Year Final Research Report

• Project/Area Number: 24650062
• Research Category: Grant-in-Aid for Challenging Exploratory Research
• Allocation Type: Multi-year Fund
• Research Field: Intelligent informatics
• Research Institution: Hokkaido University
• Principal Investigator: MINATO Shin-ichi 北海道大学, 情報科学研究科, 教授 (10374612)
• Co-Investigator(Kenkyū-buntansha): KIDA Takuya 北海道大学, 大学院情報科学研究科, 准教授 (70343316)
• Project Period (FY): 2012-04-01 – 2015-03-31
• Keywords: BDD / ZDD / 簡潔データ構造 / 離散構造 / 論理関数 / 組合せ集合

Outline of Final Research Achievements

BDD（Binary Decision Diagram) is a data structure to represent Boolean functions or combinatorial sets in a compressed index structure. Today, BDDs are widely used for various applications, however, since a BDD needs to manipulates pointers and hash tables, BDD's compression rate may become worse than naive bit string representation, for the data where BDD's compression is not very effective. In our research, we developed a new algorithm, named "DenceZDD," which generates asymptotically succinct BDD structures by packing the structural information into a bit string. In addition, we proposed a method for dynamically manipulating BDDs by hybrid combination of a Dence ZDD system and a conventional BDD manipulation system.

Free Research Field

大規模離散構造データ処理アルゴリズム