From 7351a432adb4664e4040058b3faabb2caeb5fc1d Mon Sep 17 00:00:00 2001 From: Oliver Date: Sat, 18 Sep 2021 01:01:40 -0400 Subject: [PATCH] removing recursive query computation --- appendix.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/appendix.tex b/appendix.tex index 70000f9..fd2a3c4 100644 --- a/appendix.tex +++ b/appendix.tex @@ -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)$}