Question: Suppose that we are given a relation schema R with four attributes, ABCD, and the set of FDs F = (AC -> B, AD ->
Suppose that we are given a relation schema R with four attributes, ABCD, and the set of FDs
F = (AC -> B, AD -> C, B - D ).
Assuming those are the only dependencies that hold for R, answer the following questions:
1. Is BC a superkey of R?
2. Is ABC a key of R?
3. Apply the appropriate algorithm to determine a key for R
4. Apply the appropriate algorithm to determine all the keys for R.
5. What is a prime attribute? Is attribute B a prime attribute?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
