Bottom-up evaluation of logic programs using binary decision diagrams

Mizuho Iwaihara, Yusaku Inoue

Research output: Contribution to conferencePaper

5 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages467-474
Number of pages8
Publication statusPublished - 1995 Jan 1
Externally publishedYes
EventProceedings of the 1995 IEEE 11th International Conference on Data Engineering - Taipei, Taiwan
Duration: 1995 Mar 61995 Mar 10

Other

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

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems

Fingerprint Dive into the research topics of 'Bottom-up evaluation of logic programs using binary decision diagrams'. Together they form a unique fingerprint.

  • Cite this

    Iwaihara, M., & Inoue, Y. (1995). Bottom-up evaluation of logic programs using binary decision diagrams. 467-474. Paper presented at Proceedings of the 1995 IEEE 11th International Conference on Data Engineering, Taipei, Taiwan, .