The Community for Technology Leaders
Proceedings of the Eleventh International Conference on Data Engineering (1995)
Taipei, Taiwan
Mar. 6, 1995 to Mar. 10, 1995
ISSN: 1063-6382
ISBN: 0-8186-6910-1
pp: 467
M. Iwaihara , Dept. of Inf. Syst., Kyushu Univ., Fukuoka, Japan
Y. Inoue , Dept. of Inf. Syst., Kyushu Univ., Fukuoka, Japan
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.
INDEX TERMS
logic programming; diagrams; decision theory; data structures; Boolean functions; query processing; optimisation; deductive databases; bottom-up evaluation; logic programs; binary decision diagrams; data structure; Boolean functions; VLSI CAD; temporary relations; logic queries; logarithmic encoding; linear encoding; relational operations; hash table-based methods; transitive closure queries; dense graphs; deductive database; logic-based query language
CITATION

Y. Inoue and M. Iwaihara, "Bottom-up evaluation of logic programs using binary decision diagrams," Proceedings of the Eleventh International Conference on Data Engineering(ICDE), Taipei, Taiwan, 1995, pp. 467.
doi:10.1109/ICDE.1995.380367
83 ms
(Ver 3.3 (11022016))