IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 2    
Website: http://www.ijser.org
scirp IJSER >> Volume 3,Issue 2,February 2012
Analysis of Execution Plans in Query Optimization
Full Text(PDF, )  PP.585-588  
Author(s)
Dr. Sunita M. Mahajan, Mrs. Vaishali P. Jadhav
KEYWORDS
— Execution plan, index selection, join selection, query analysis, query optimization.
ABSTRACT
The sequence in which the source tables are accessed during query execution is called a query execution plan. The process of selecting one execution plan from potentially many possible plans is referred to as query optimization. The query optimizer is one of the most important components of a query processor. The input to the optimizer consists of the query, the database schema (table and index definitions), and the database statistics. The output of the optimizer is a query execution plan, sometimes referred to as a query plan or just a plan. The goal is to eliminate as many unneeded tuples, or rows as possible. The paper describes the design of query optimizer with four basic phases such as Query Analysis, Index Selection Join Selection and Plan Selection.
References
[1] Ramez Elmasri and Shamkant B. Navathe. Fundamentals of Database Systems, second edition. Addison-Wesley Publishing Company, 1994.

[2] Avi Silbershatz, Hank Korth and S. Sudarshan. Database System Concepts, 4th Edition. McGraw-Hill,2002

[3] Henk Ernst Blok, Djoerd Hiemstra and Sunil Choenni, Franciska de Jong, Henk M. Blanken and Peter M.G. Apers.Predictingthe cost-quality trade-off for information retrieval queries: Facilitatiing database design and query optimization. Proceedings of the tenth international conference on Information and knowledge management, October 2001, Pages 207-214.

[4] Reza Sadri, Carlo Zaniolo, Amir Zarkesh and Jafar Adibi. Optimization of Sequence Queries in Database Systems. In Proceedings of the twentieth ACM SIGMOD-SIGACTSIGART symposium on Principles of database systems, May 2001, Pages 71-81.

[5] G. Antoshenkov, “Dynamic Query Optimization in RdblVMS”, Proc. IEEE Int „1. Conf on Data Eng.,Vienna, Austria, April 1993,538.

[6] Inside Microsoft SQL Server 2000. http://flylib.com/books/en/2.257.1.137/1/

[7] K. Ono and G, M, Lehman, “Measuring the Complexity of Join Enumeration in Query Optimization”, Proc. Int„1. Con$ on Ve~ Large Data Bases, Brisbane, Australia, August 1990,31

Untitled Page