this is for holding javascript data
H.S.Bhathiya edited section_Query_Optimization_and_Execution__.tex
about 8 years ago
Commit id: d86110f61f4b1e716701c6f799fbc58b44cf725b
deletions | additions
diff --git a/section_Query_Optimization_and_Execution__.tex b/section_Query_Optimization_and_Execution__.tex
index 2b7d2ed..edbeda4 100644
--- a/section_Query_Optimization_and_Execution__.tex
+++ b/section_Query_Optimization_and_Execution__.tex
...
\subsection{Join Query Execution Plans}
Consider query
SELECT \textbf{SELECT * FROM A
\\
JOIN \\}
\textbf{JOIN B ON A.ID = B.ID
\\
JOIN \\}
\textbf{JOIN C ON A.ID = C.ID
\\
JOIN \\}
\textbf{JOIN D ON A.ID = D.ID
\\ \\}
Two possible execution plans are deep-left tree (shown in Figure-1 ) and Bushy Tree (shown in Figure-2). Other possible structures include right-deep trees zig-zag trees. Similar to deep-left trees right-deep and zig-zag are linear tree structure. But bushy trees are different and more complicated compared to others.