1. (5 pts) Prove the soundness of the psuedotransitivity rule using Armstrong's axioms.
2. The following questions all refer to a relation scheme R = (A, B, C, D, E, G) and set of functional dependencies F = .
   1. (3 pts) Find in F.
   2. (10 pts) Find a candidate key for relations on scheme R, and show that your answer is a candidate key. (Hint: first show that your answer is a superkey, and then show that removing any attribute from your answer results in an attribute set that is no longer a superkey.)
   3. (10 pts) Find F , a canonical cover of F.

• About this document ...