Question

Consider a database with relations R(A,B,C), S(D,E), and T(F,G).
(i) Give the initial query plan (constructed as in Lecture 12) for the SQL query
SELECT B, E, G
FROM R, S, T
WHERE A = 10 AND C = D AND E = F AND A > G;
Then use the heuristics from Lecture 16 to transform the initial query plan into an optimised
(logical) query plan. Perform the transformation step-wise, pushing a single operator over a
single operator in each step, and indicate the heuristics you apply.