{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

ch13 - Chapter 13 Query Processing Chapter Database System...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
Database System Concepts, 5th Ed . ©Silberschatz, Korth and Sudarshan See www.db-book.com for conditions on re-use Chapter 13: Query Processing Chapter 13: Query Processing
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
©Silberschatz, Korth and Sudarshan 13.2 Database System Concepts - 5 th Edition, Aug 27, 2005. Chapter 13: Query Processing Chapter 13: Query Processing Overview Measures of Query Cost Selection Operation Sorting Join Operation Other Operations Evaluation of Expressions
Background image of page 2
©Silberschatz, Korth and Sudarshan 13.3 Database System Concepts - 5 th Edition, Aug 27, 2005. Basic Steps in Query Processing Basic Steps in Query Processing 1. Parsing and translation 2. Optimization 3. Evaluation
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
©Silberschatz, Korth and Sudarshan 13.4 Database System Concepts - 5 th Edition, Aug 27, 2005. Basic Steps in Query Processing (Cont.) (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.
Background image of page 4
©Silberschatz, Korth and Sudarshan 13.5 Database System Concepts - 5 th Edition, Aug 27, 2005. Basic Steps in Query Processing : Optimization Optimization A relational algebra expression may have many equivalent expressions E.g., σ balance < 2500 ( balance ( account)) is equivalent to balance ( σ 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
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
©Silberschatz, Korth and Sudarshan 13.6 Database System Concepts - 5 th Edition, Aug 27, 2005. Basic Steps: Optimization (Cont.) 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
Background image of page 6
©Silberschatz, Korth and Sudarshan 13.7 Database System Concepts - 5 th Edition, Aug 27, 2005. Measures of Query Cost Measures of Query Cost Cost is generally measured as total elapsed time for answering query Many factors contribute to time cost disk accesses, CPU , or even network communication Typically disk access is the predominant cost, and is also relatively easy to estimate. Measured by taking into account Number of seeks * average-seek-cost Number of blocks read
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}