ODIn/paper-BagRelationalPDBsAreHard
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

removing recursive query computation

Browse source
This commit is contained in:
Oliver Kennedy 2021-09-18 01:01:40 -04:00
parent 18d105f610
commit 7351a432ad
Signed by: okennedy
GPG key ID: 3E5F9B3ABD3FDB60
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
appendix.tex
View file

@ -111,11 +111,11 @@ We define the circuit for a select-union-project-join $Q$ recursively by cases a
\EndFor
\ElsIf{$\query$ is $\query_1 \bowtie \ldots \bowtie \query_k$}
\For{$i \in [1, k]$}
$\tuple{V_i, E_i, \phi_i, \ell_i} = \abbrStepOne(\query_i, \dbbase)$
\State $\tuple{V_i, E_i, \phi_i, \ell_i} = \abbrStepOne(\query_i, \dbbase)$
\EndFor
\State $V = V_1 \cup \ldots \cup V_k \cup \comprehension{v_t}{t \in \domain(\phi_1) \bowtie \ldots \bowtie \domain(\phi_k)}$
\State $E = E_1 \cup \ldots \cup E_k \cup \bigcup_{i \in [1,k]}
\comprehension{(\phi_i(\pi_{sch}(\query_i)(t))}{t \in \domain(\phi_1) \bowtie \ldots \bowtie \domain(\phi_k)}$\Comment{Nodes with in-degrees above 2 are corrected (with $\log_2(k)$ overhead) with an equivalent fan-in tree.}
\comprehension{(\phi_i(\pi_{sch(\query_i)}(t))}{t \in \domain(\phi_1) \bowtie \ldots \bowtie \domain(\phi_k)}$
\State $\phi = \phi_1 \cup \ldots \cup \phi_k$
\State $\ell = \ell_1 \cup \ldots \cup \phi_k$
\For{$t \in \domain(\phi_1) \bowtie \ldots \bowtie \domain(\phi_k)$}