.png){kind=icon}
.png){kind=icon}
Return
Building Relational Circuits
.png){kind=icon}
PRE
AI
DOI：10.4230/LIPIcs.ICDT.2026.3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We review two algorithms which allow to build a factorized representation of the answers set of join queries. In a nutshell, the representation builds a circuit representing the answers set of a join query by starting from atomic relations and iteratively combine them by either constructing the Cartesian product or the disjoint union of previously computed relations. The first one can be seen as the trace of the celebrated Yannakakis algorithm, building the answer set from the inputs to the output of the circuit while the second adopts a top-down approach which can be seen as a generalization of the exhaustive DPLL algorithm, originally designed to solve the #SAT problem.
Keywords:
Conjunctive queries
factorized databases
knowledge compilation
Journal
2
IF:
0
Papers:
28
Citations:
0