this is for holding javascript data
H.S.Bhathiya(110059X) edited section_Query_Optimization_and_Execution__.tex
about 8 years ago
Commit id: 494334d13878fb648f20e0e91596ea5403af4a4a
deletions | additions
diff --git a/section_Query_Optimization_and_Execution__.tex b/section_Query_Optimization_and_Execution__.tex
index 4ec42c1..d9da5da 100644
--- a/section_Query_Optimization_and_Execution__.tex
+++ b/section_Query_Optimization_and_Execution__.tex
...
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.
\subsection{Challenegs in Bushy Tree Implementation}
Moving from left-deep tree to a Bushy tree is a challenge as the number of possible structures in bushy trees are much larger. Left-deep trees have only one structure regardless of the number of
attributes tables involved. Therefor the number of possible permutations are N! . But for bushy trees possible number of structures are given by
$$ S(N) = 1 if $N = 1 $ \\
S(N) = $\displaystyle \sum_{N=1}^{i} (N)(N-i)$ if N > 1 $$\\