Question: Consider a key K that uniquely identifies any row in a table. Now consider the set of tuples {K1, K2... Kn), such that each K;
Consider a key K that uniquely identifies any row in a table. Now consider the set of tuples {K1, K2... Kn), such that each K; is formed by taking away one attributed from K. If none of the tuples K; for i = 1..n is a key, then K must be a candidate key. True False
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
