Bottom-up evaluation of logic programs using binary decision diagrams

Mizuho Iwaihara*, Yusaku Inoue

*この研究の対応する著者

研究成果: Paper査読

6 被引用数 (Scopus)

抄録

Binary decision diagram (BDD) is a data structure to manipulate Boolean functions and recognized as a powerful tool in the VLSI CAD area. We consider that compactness and efficient operations of BDDs can be utilized for storing temporary relations in bottom-up evaluation of logic queries. We show two methods of encoding relations into BDDs, called logarithmic encoding and linear encoding, define relational operations on BDDs and discuss optimizations in ordering BDD variables to construct memory and time efficient BDDs. Our experiments show that our BDD-based bottom-up evaluator has remarkable performance against traditional hash table-based methods for transitive closure queries on dense graphs.

本文言語English
ページ467-474
ページ数8
出版ステータスPublished - 1995 1 1
外部発表はい
イベントProceedings of the 1995 IEEE 11th International Conference on Data Engineering - Taipei, Taiwan
継続期間: 1995 3 61995 3 10

Other

OtherProceedings of the 1995 IEEE 11th International Conference on Data Engineering
CityTaipei, Taiwan
Period95/3/695/3/10

ASJC Scopus subject areas

  • ソフトウェア
  • 信号処理
  • 情報システム

フィンガープリント

「Bottom-up evaluation of logic programs using binary decision diagrams」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル