this is for holding javascript data
Bhathiya edited section_Challenegs_in_Bushy_Trees__.tex
about 8 years ago
Commit id: 007c096935ed9973ac46a2043c1a400079810774
deletions | additions
diff --git a/section_Challenegs_in_Bushy_Trees__.tex b/section_Challenegs_in_Bushy_Trees__.tex
index 94967bf..ba023db 100644
--- a/section_Challenegs_in_Bushy_Trees__.tex
+++ b/section_Challenegs_in_Bushy_Trees__.tex
...
\section{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 involved. Therefor the number of possible permutations are N! . But for bushy trees possible number of structures are given by
$$f(x) = \begin{cases}
0 & \text{if $0 < x \le 0.05$}; \\
0.1 & \text{if $0.05 < x \le 1$}; \\
0.2 & \text{if $1 < x \le 5$};\\
2^{\frac{x}{20}} & \text{if $5 < x \le 100$};.\end{cases} $$
$$S(N) = \begin{cases}
1 \text{if $ N = 1$}; \\