Bottom-up evaluation of logic programs using binary decision diagrams

Mizuho Iwaihara, Yusaku Inoue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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
Title of host publicationProceedings - International Conference on Data Engineering
Place of PublicationLos Alamitos, CA, United States
PublisherIEEE
Pages467-474
Number of pages8
Publication statusPublished - 1995
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

Fingerprint

Binary decision diagrams
Boolean functions
Data structures
Computer aided design
Data storage equipment
Experiments

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Engineering (miscellaneous)

Cite this

Iwaihara, M., & Inoue, Y. (1995). Bottom-up evaluation of logic programs using binary decision diagrams. In Proceedings - International Conference on Data Engineering (pp. 467-474). Los Alamitos, CA, United States: IEEE.

Bottom-up evaluation of logic programs using binary decision diagrams. / Iwaihara, Mizuho; Inoue, Yusaku.

Proceedings - International Conference on Data Engineering. Los Alamitos, CA, United States : IEEE, 1995. p. 467-474.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Iwaihara, M & Inoue, Y 1995, Bottom-up evaluation of logic programs using binary decision diagrams. in Proceedings - International Conference on Data Engineering. IEEE, Los Alamitos, CA, United States, pp. 467-474, Proceedings of the 1995 IEEE 11th International Conference on Data Engineering, Taipei, Taiwan, 95/3/6.
Iwaihara M, Inoue Y. Bottom-up evaluation of logic programs using binary decision diagrams. In Proceedings - International Conference on Data Engineering. Los Alamitos, CA, United States: IEEE. 1995. p. 467-474
Iwaihara, Mizuho ; Inoue, Yusaku. / Bottom-up evaluation of logic programs using binary decision diagrams. Proceedings - International Conference on Data Engineering. Los Alamitos, CA, United States : IEEE, 1995. pp. 467-474
@inproceedings{0ff13f5b883344ebb601c4a2cdc2872d,
title = "Bottom-up evaluation of logic programs using binary decision diagrams",
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.",
author = "Mizuho Iwaihara and Yusaku Inoue",
year = "1995",
language = "English",
pages = "467--474",
booktitle = "Proceedings - International Conference on Data Engineering",
publisher = "IEEE",

}

TY - GEN

T1 - Bottom-up evaluation of logic programs using binary decision diagrams

AU - Iwaihara, Mizuho

AU - Inoue, Yusaku

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029232286&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029232286&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0029232286

SP - 467

EP - 474

BT - Proceedings - International Conference on Data Engineering

PB - IEEE

CY - Los Alamitos, CA, United States

ER -