{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

08_qp_opt - CPS216 Data-intensive Computing Systems Query...

Info icon This preview shows pages 1–14. Sign up to view the full content.

View Full Document Right Arrow Icon
CPS216: Data-intensive Computing Systems Query Optimization (Cost- based optimization) Shivnath Babu
Image of page 1

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

View Full Document Right Arrow Icon
Query Optimization Problem Pick the best plan from the space of physical plans
Image of page 2
Cost-Based Optimization Prune the space of plans using heuristics Estimate cost for remaining plans Be smart about how you iterate through plans Pick the plan with least cost Focus on queries with joins
Image of page 3

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

View Full Document Right Arrow Icon
Heuristics for pruning plan space Predicates as early as possible Avoid plans with cross products Only left-deep join trees
Image of page 4
Physical Plan Selection Logical Query Plan P1 P2 …. Pn C1 C2 …. Cn Pick minimum cost one Physical plans Costs
Image of page 5

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

View Full Document Right Arrow Icon
Review of Notation T (R) : Number of tuples in R B (R) : Number of blocks in R
Image of page 6
Simple Cost Model Cost (R S) = T(R) + T(S) Cost (R S) = T(R) + T(S) All other operators have 0 cost Note: The simple cost model used for illustration only
Image of page 7

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

View Full Document Right Arrow Icon
Cost Model Example R S T X T(R) + T(S) T(X) + T(T) Total Cost: T(R) + T(S) + T(T) + T(X)
Image of page 8
Selinger Algorithm Dynamic Programming based Dynamic Programming: General algorithmic paradigm Exploits “principle of optimality” Useful reading: Chapter 16, Introduction to Algorithms, Cormen, Leiserson, Rivest
Image of page 9

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

View Full Document Right Arrow Icon
Principle of Optimality Optimal for “whole” made up from optimal for “parts”
Image of page 10
Principle of Optimality Query: R1 R2 R3 R4 R5 R3 R2 R4 R1 R5 Optimal Plan:
Image of page 11

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

View Full Document Right Arrow Icon
Principle of Optimality Query: R1 R2 R3 R4 R5 R3 R2 R4 R1 R5 Optimal Plan: Optimal plan for joining R3, R2, R4, R1
Image of page 12
Principle of Optimality Query: R1 R2 R3 R4 R5 R3 R2 R4 R1 R5 Optimal Plan: Optimal plan for joining R3, R2, R4
Image of page 13

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

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

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern