[DMDB] Fix issues, improve query processing with notes on time complexities

This commit is contained in:
janishutz committed 2026-07-27 14:41:27 +02:00
1 parent d197d01f24
commit be2e079959
22 files changed
+142 -34

No files matched your search

@@ -13,4 +13,6 @@
\EndProcedure
\end{algorithmic}
\end{algorithm}
Here, the max output size is $T_R \cdot T_S$, where $T_X$ is the number of tuples for realtion $X$.
Here, the max output size is $T_R \cdot T_S$, where $T_X$ is the number of tuples for relation $X$.
The cost is obviously \cost{$\texttt{cnt}(R) \cdot \texttt{cnt}(S)$}, with $\texttt{cnt}(X)$ the number of tuples in $X$.