Question: 07. Consider a database containing two relations: R(A,B,C) and S(D.E.F). For each of three (your choice) of the 12 rewriting rules for relational algebra expression,

07. Consider a database containing two relations: R(A,B,C) and S(D.E.F). For each of three (your choice) of the 12 rewriting rules for relational algebra expression, give an example pair of relational algebra expressions involving R and S such that the rule rewrites one expression to the other expression, and give another example pair to show the rewriting rule cannot be used since some of the conditions for the rule are not satisfied
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
