Research on Algorithms to Process Directed Acyclic Graph Based on Binary Decision Diagrams

Research Project

Project/Area Number	15H06101
Research Category	Grant-in-Aid for Research Activity Start-up
Allocation Type	Single-year Grants
Research Field	Intelligent informatics
Research Institution	The University of Tokyo
Principal Investigator	Denzumi Shuhei 東京大学, 大学院情報理工学系研究科, 助教 (90755729)
Project Period (FY)	2015-08-28 – 2017-03-31
Project Status	Completed (Fiscal Year 2016)
Budget Amount *help	¥2,990,000 (Direct Cost: ¥2,300,000、Indirect Cost: ¥690,000) Fiscal Year 2016: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000) Fiscal Year 2015: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Keywords	非巡回有向グラフ / 二分決定グラフ / アルゴリズム / データ構造 / 圧縮処理 / 簡潔データ構造 / 文字列索引 / 近似文字列照合 / 完結データ構造 / 部分文字列索引 / グラフ / 二分木 / ランダム生成
Outline of Final Research Achievements	I have developed methods to process and analyze huge databases that are efficiently represented as directed acyclic graphs, by using Binary Decision Diagrams (BDDs). I have researched data structures to represent huge databases as directed acyclic graphs in compressed form, efficient algorithms to process and analyze databases based on BDDs, and applying these fundamental techniques for real data with performance evaluations and feedbacks.

Report

(3 results)