this is for holding javascript data
H.S.Bhathiya(110059X) added section_Proposed_Solution_We_propose__.tex
about 8 years ago
Commit id: 9a02fe2b938d30a9a196d4d748fde17ad57ef91c
deletions | additions
diff --git a/section_Proposed_Solution_We_propose__.tex b/section_Proposed_Solution_We_propose__.tex
new file mode 100644
index 0000000..c1201ad
--- /dev/null
+++ b/section_Proposed_Solution_We_propose__.tex
...
\section{Proposed Solution }
We propose to implement Apache Derby bushy tree base execution plan generation as a collection of deep-left trees. For example a query involving about 10 tables will be considered evaluated by joining 3 or 4 left-deep trees. Connection those tree results in a bushy tree. Main advantage of this approach is that it would benefit from already implemented left deep trees. How ever it may fail guarantee a optimum result and the level optimization would depend on the intermediate left-deep trees built.
Here we have demonstrated our approach using of oracle database. Consider following two queries.
\begin{document}
\begin{verbatim}
a = LOAD `data' USING BinStorage AS (user);
b = GROUP a BY user;
c = FOREACH b GENERATE COUNT(a) AS cnt;
d = ORDER c BY cnt;
\end{verbatim}
\end{document}
