Consider a database with three relations: $R(A_{,}B,D,E)$;$S(C_{,}A,F,G)$;$P(B,C,H,I)$

Assume the following schemas and statistics for the relations.

$T(P)=10000V(P,C)=100V(P,B)=150===$ AND $R.D=16$ AND $R.E>400$ AND $S.F=17R(A_{,}B,D,E)$

$S(C_{,}A,F,G)$

$P(B,C,H,I)$

$-T(R)=10000$

$-V(R,B)=200$

$-V(R,D)=100$

$-10$

$T(P)=10000,$

$V(P,C)=100$

$V(P,B)=150$

Consider the following query:

SELECT $R.D,S.F$

FROM $R,S,P$

WHERE $R.A=S.$A and $R.B=P.B$ AND $P.C=S.C$

AND $R.D=16$ AND $R.E>400$ AND $S.F=17$

Draw the initial tree for this query, and then show how the query tree $is$ optimized $by$

the heuristic rules.

Give the estimation cardinality $of$ each step $in$ your plan.