Question: You are given a relation scheme R B, N, S, T, A, R, C where B Building, N Door Number, S - Street, T -Type,

You are given a relation scheme R B, N, S, T, A, R, C where B Building, N Door Number, S - Street, T -Type, A Architect, R Subcontractor and C Class. Constraints between the attributes can be expressed in the form of the following functional dependencies: Find all candidate keys of F. Prove that these are the only keys (15 points) Derive a canonical cover for F in a systematic manner (15 points). Does a set of FD's have a unique canonical cover? Why? (5 points) Decompose R into a set of 3NF schemes which preserve all dependencies in F a. b. c. d. and form a lossless join (10 points)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
