Table of Contents
Query Processing
Rough Architecture of the Query Processor
PPT Slide
PPT Slide
The Journey of a Query Continues at the Physical Plan Generator
More Than One Plans May be Generated and Evaluated
Issues in Query Processing and Optimization
Algebraic Operators: A Bag version
Extended Projection
An Alternative Approach to Arithmetic and Other 1-1 Computations
Product and Joins
Grouping and Aggregation
Algebraic Rewritings: Commutativity and Associativity
Algebraic Rewritings: Commutativity and Associativity (2)
Algebraic Rewritings for Selection: Decomposition of Logical Connectives
Algebraic Rewritings for Selection: Decomposition of Negation
Pushing the Selection Thru Binary Operators: Union and Difference
PPT Slide
Pushing Simple Projections Thru Binary Operators
Pushing Simple Projections Thru Binary Operators: Join and Cartesian Product
Projection Decomposition
Some Rewriting Rules Related to Aggregation: SUM
Remarks
Exercises
Algorithms for Relational Algebra Operators
Computation Model
Notation
One-Pass Main Memory Algorithms for Unary Operators
One-Pass Nested Loop Join
Generalization of Nested-Loops
PPT Slide
Efficient Sort-Merge Join
Efficient Sort-Merge Join Example
Two-Pass Hash-Based Algorithms
Hash-Join Algorithms
Index-Based Join: The Simplest Version
Opportunities in Joins Using Sorted Indexes
Recap
|