Chapter 13:Query Processing Overview Measures of Query Cost Selection Operation Sorting Join Operation Other Operations Evaluation of Expressions Database System Concepts-5th Edition,Aug 27,2005. 13.2 @Silberschatz,Korth and Sudarshan
Database System Concepts - 5 13.2 ©Silberschatz, Korth and Sudarshan th Edition, Aug 27, 2005. Chapter 13: Query Processing Overview Measures of Query Cost Selection Operation Sorting Join Operation Other Operations Evaluation of Expressions
Basic Steps in Query Processing 1.Parsing and translation 2.Optimization 3.Evaluation parser and relational algebra query translator expression optimizer query output evaluation engine execution plan data statistics about data Database System Concepts-5th Edition,Aug 27,2005. 13.3 ©Silberschat乜，Korth and Sudarshan
Database System Concepts - 5 13.3 ©Silberschatz, Korth and Sudarshan th Edition, Aug 27, 2005. Basic Steps in Query Processing 1. Parsing and translation 2. Optimization 3. Evaluation
Basic Steps in Query Processing (Cont.) Parsing and translation translate the query into its internal form.This is then translated into relational algebra. Parser checks syntax,verifies relations Evaluation The query-execution engine takes a query-evaluation plan,executes that plan,and returns the answers to the query. Database System Concepts-5th Edition,Aug 27,2005. 13.4 @Silberschatz,Korth and Sudarshan
Database System Concepts - 5 13.4 ©Silberschatz, Korth and Sudarshan th Edition, Aug 27, 2005. Basic Steps in Query Processing (Cont.) Parsing and translation translate the query into its internal form. This is then translated into relational algebra. Parser checks syntax, verifies relations Evaluation The query-execution engine takes a query-evaluation plan, executes that plan, and returns the answers to the query
Basic Steps in Query Processing Optimization A relational algebra expression may have many equivalent expressions E.g.,balance<2500(Ibalance(account))is equivalent to Ibalance(balance<2500(account)) Each relational algebra operation can be evaluated using one of several different algorithms Correspondingly,a relational-algebra expression can be evaluated in many ways. Annotated expression specifying detailed evaluation strategy is called an evaluation-plan. E.g.,can use an index on balance to find accounts with balance 2500, or can perform complete relation scan and discard accounts with balance≥2500 Database System Concepts-5th Edition,Aug 27,2005. 13.5 ©Silberschat乜，Korth and Sudarshan
Database System Concepts - 5 13.5 ©Silberschatz, Korth and Sudarshan th Edition, Aug 27, 2005. Basic Steps in Query Processing : Optimization A relational algebra expression may have many equivalent expressions E.g., balance2500(balance(account)) is equivalent to balance(balance2500(account)) Each relational algebra operation can be evaluated using one of several different algorithms Correspondingly, a relational-algebra expression can be evaluated in many ways. Annotated expression specifying detailed evaluation strategy is called an evaluation-plan. E.g., can use an index on balance to find accounts with balance < 2500, or can perform complete relation scan and discard accounts with balance 2500
Basic Steps:Optimization (Cont.) Query Optimization:Amongst all equivalent evaluation plans choose the one with lowest cost. Cost is estimated using statistical information from the database catalog e.g.number of tuples in each relation,size of tuples,etc. In this chapter we study How to measure query costs Algorithms for evaluating relational algebra operations How to combine algorithms for individual operations in order to evaluate a complete expression In Chapter 14 We study how to optimize queries,that is,how to find an evaluation plan with lowest estimated cost Database System Concepts-5th Edition,Aug 27,2005. 13.6 @Silberschatz,Korth and Sudarshan
Database System Concepts - 5 13.6 ©Silberschatz, Korth and Sudarshan th Edition, Aug 27, 2005. Basic Steps: Optimization (Cont.) Query Optimization: Amongst all equivalent evaluation plans choose the one with lowest cost. Cost is estimated using statistical information from the database catalog e.g. number of tuples in each relation, size of tuples, etc. In this chapter we study How to measure query costs Algorithms for evaluating relational algebra operations How to combine algorithms for individual operations in order to evaluate a complete expression In Chapter 14 We study how to optimize queries, that is, how to find an evaluation plan with lowest estimated cost