Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Q6. Consider the following query Q over R(A,B,C) and S(D,E,F): SELECT A,F FROM R, S WHERE C=D AND A < 1000 AND E='e' Assume there is a clustering index on E of S, an index on D of S, an index on C of R, and a clustering index on A of R. Assume the indices have equal height. Assume R and S have roughly equal sizes (in both number of blocks and number of records), and assume that oE-e(S) is twice the size of OA<1000(R). 6.a Draw the canonical query tree for the query Q. 6.b Transform the canonical query tree for Q into a final query tree that is efficient to execute. 6.c Describe the best query evaluation plan (with minimal cost) for Q for the information given. 6.d Draw another left-deep query tree whose cost is higher than the one given in 6.c. 6.e Give one example instance of relational algebra rewriting, for each rewriting rule that was used in the trees of 6.a and 6.b.

Q6. Consider the following query Q over R(A,B,C) and S(D,E,F): SELECT A,F FROM R, S WHERE C=D AND A < 1000 AND E='e' Assume there is a clustering index on E of S, an index on D of S, an index on C of R, and a clustering index on A of R. Assume the indices have equal height. Assume R and S have roughly equal sizes (in both number of blocks and number of records), and assume that oE-e(S) is twice the size of OA<1000(R). 6.a Draw the canonical query tree for the query Q. 6.b Transform the canonical query tree for Q into a final query tree that is efficient to execute. 6.c Describe the best query evaluation plan (with minimal cost) for Q for the information given. 6.d Draw another left-deep query tree whose cost is higher than the one given in 6.c. 6.e Give one example instance of relational algebra rewriting, for each rewriting rule that was used in the trees of 6.a and 6.b.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Q6. Consider the following query Q over R(A,B,C) and S(D,E,F): SELECT A,F FROM R, S WHERE C=D AND A < 1000 AND E='e' Assume there is a clustering index on E of S, an index on D of S, an index on C of R, and a clustering index on A of R. Assume the indices have equal height. Assume R and S have roughly equal sizes (in both number of blocks and number of records), and assume that oE-e(S) is twice the size of oA<1000(R). 6.a Draw the canonical query tree for the query Q. 6.b Transform the canonical query tree for Q into a final query tree that is efficient to execute. 6.c Describe the best query evaluation plan (with minimal cost) for Q for the information given. 6.d Draw another left-deep query tree whose cost is higher than the one given in 6.c. 6.e Give one example instance of relational algebra rewriting, for each rewriting rule that was used in the trees of 6.a and 6.b.
Transcribed Image Text:Q6. Consider the following query Q over R(A,B,C) and S(D,E,F): SELECT A,F FROM R, S WHERE C=D AND A < 1000 AND E='e' Assume there is a clustering index on E of S, an index on D of S, an index on C of R, and a clustering index on A of R. Assume the indices have equal height. Assume R and S have roughly equal sizes (in both number of blocks and number of records), and assume that oE-e(S) is twice the size of oA<1000(R). 6.a Draw the canonical query tree for the query Q. 6.b Transform the canonical query tree for Q into a final query tree that is efficient to execute. 6.c Describe the best query evaluation plan (with minimal cost) for Q for the information given. 6.d Draw another left-deep query tree whose cost is higher than the one given in 6.c. 6.e Give one example instance of relational algebra rewriting, for each rewriting rule that was used in the trees of 6.a and 6.b.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 3 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS