Research Article
A Comparative Analysis of Reduction Algorithms in Picasso Tool for Cost Based Query Optimizers of Relational Databases
@INPROCEEDINGS{10.1007/978-3-642-27308-7_18, author={Neeraj Sharma and Yogendra Jain}, title={A Comparative Analysis of Reduction Algorithms in Picasso Tool for Cost Based Query Optimizers of Relational Databases}, proceedings={Advances in Computer Science and Information Technology. Computer Science and Engineering. Second International Conference, CCSIT 2012, Bangalore, India, January 2-4, 2012. Proceedings, Part II}, proceedings_a={CCSIT PATR II}, year={2012}, month={11}, keywords={Query Optimization Selectivity Plan Cardinality Plan Diagrams Checkpoints TPCH}, doi={10.1007/978-3-642-27308-7_18} }- Neeraj Sharma
Yogendra Jain
Year: 2012
A Comparative Analysis of Reduction Algorithms in Picasso Tool for Cost Based Query Optimizers of Relational Databases
CCSIT PATR II
Springer
DOI: 10.1007/978-3-642-27308-7_18
Abstract
Query optimization is a process of selecting an optimal Query Execution Plan from a number of plans available for execution of query which is very critical to the performance of a relational database. Picasso is a Query Optimizer analysis tool developed in the Database lab of Indian Institute of Science [24]. Using Picasso we can visualize the query execution plans and can implement a technique known as Plan Diagram Reduction [15][16][17] which can effectively increase the Query Optimizer performance. In this paper we briefly introduce the query optimization concept and then perform an exhaustive analysis of the reduction algorithms and try to establish some hard fact about their relative performance and reduction efficiency.
