3,553 views
4 votes
4 votes

If a table $R$ has only one candidate key, then which of the following is always true?

  • $R$ is in 2NF, but is not in 3NF
  • If $R$ is in 3NF, it is also in BCNF
  • $R$ is in 2NF, but may not be in 3NF
  • None of these

3 Answers

2 votes
2 votes

option B is correct. As option it says "if" it is in 3NF then surely it will be in BCNF because to be a relation in 3NF not in BCNF atleast two compound keys are needed, so that proper set of one candidate key drives proper subset of other candidate key.

if option B was not there then following points need to be consider:

1.) If candidate key is compound key then there may be chance that proper subset of candidate key drive non prime attribute {known as partial dependency}

2.) If candidate key is simple key , then if can say there is no partial dependency and relation is in 2NF but may or may not be in 3NF.

edited by
0 votes
0 votes

Counter Example  for option a and c:

Consider R(ABCDE) and FD: { AB→ CD, B→ E}

we get CK = { AB} and prime attributes = A,B

2nd FD gives (PA → Non PA/ Part of the key → Non key), therefore it violates 2NF.  Now check the options 

option a:  R is in 2NF, but is not in 3NF. False

option c: R is in 2NF, but may not be in 3NF False

option b : If R is in 3NF, it is also in BCNF. True . Because to be a relation in 3NF not in BCNF then atleast two compound overlapping keys are needed.

Related questions

0 votes
0 votes
6 answers
1
kaustubh7 asked Sep 20, 2023
859 views
Consider a relation $R(ABCDEFGH)$.How many superkeys will be there in relation $R$ if the candidate keys for relation are ${A, BC, CDE, EF}$?
6 votes
6 votes
5 answers
3