Question: Consider the relation schema R={A, B, C, D} with an unknown set of functional dependencies: What is the maximum number of (candidate) keys that R
Consider the relation schema R={A, B, C, D} with an unknown set of functional dependencies:
What is the maximum number of (candidate) keys that R may have? Design a set of functional depen- dencies on R to achieve the maximum number of (candidate) keys. Justify your answers.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
