作成者 |
|
|
本文言語 |
|
出版者 |
|
|
発行日 |
|
収録物名 |
|
巻 |
|
号 |
|
開始ページ |
|
終了ページ |
|
出版タイプ |
|
アクセス権 |
|
JaLC DOI |
|
関連DOI |
|
|
|
|
関連URI |
|
|
|
|
関連情報 |
|
|
|
|
概要 |
This paper proposes a method of representing relations implicitly using binary decision diagrams (BDD), which are data structures to represent logic functions compactly, and are widely used in compute...r-aided design (CAD)area We consider utilization of BDD for query processing in deductive databases. In this paper, we show two methods, called linear encoding and logarithmic encoding, to represent relations implicitly using BDDs. We compared the performances of these encodings with the traditional evaluation based on hash joins, and the proposed methods are faster than the hash-join-based methods over transitive closure queries on linear graphs and dense random graphs.続きを見る
|