Question discussion

A relation may have nor than one key. In this case, each of these keys is called a

2925Easy DSSSB TGT Computer Science 0 replies 2 views

0

A relation may have nor than one key. In this case, each of these keys is called a

APrimary key
BSecondary key
CForeign key
DCandidate key

Correct answer: D

Explanation

Each minimal key of a relation is a candidate key.

Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!