Query transformation for exact cardinality computing

Query transformation for exact cardinality computing,10.1109/ICCRD.2011.5763896,Prariwat Kwanglat,Juggapong Natwichai

Query transformation for exact cardinality computing  
BibTex | RIS | RefWorks Download
In general, query optimizers rely on a cost model to choose an appropriate query execution plan for the given queries. An important key parameter of the cost esti- mation is the cardinality of sub-expressions of the queries. Traditionally, the optimizers may use the estimation cardi- nality techniques, which can lead to the estimation errors, and hence the poor execution plans. The exact cardinality approach can be applied to resolve such problem, though its computational expense can be costly. A possible way to im- prove the efficiency is the query transformation since it can provide the alternation to the optimizers. In this paper, we focus on investigation at the effects of the query transfor- mation to the exact cardinality computing processes. The query transformation techniques to be considered in our work are the traditional but widely applied techniques, i.e. subquery unnesting, group-by view merging, join factoriza- tion, and join predicate pushdown. The experiment results on the real-life datasets have been presented to validate such proposed work.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.