1,654 views
3 votes
3 votes
Consider the following statements about relation R:

S1: If a relation R is in 3NF but not in BCNF, then relation R must consist proper subset of candidate key determines proper subset of some other candidate key.

S2: If a relation R is in 3NF but not BCNF, then relation R must consist atleast two over-lapped candidate keys.

Which of the following statements is/are correct?

(a) Both S1 and S2

(b) Only S1

© Only S2

(d) None of the above

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
jiminpark asked Dec 22, 2021
363 views
3 votes
3 votes
2 answers
2
Ram Swaroop asked Jan 30, 2019
1,301 views
Consider the following relation R(A1, A2,...A15) with (A1,A2, ... A6) of relation R are simple candidate key. The number of possible superkey in relation R is_
1 votes
1 votes
2 answers
3
Gate Fever asked Jan 17, 2019
2,667 views
minimum number of nodes (both leaf and non leaf) of B+ tree index required for storing 5500 keys and order of B+ tree is 8 _________(order is maximum pointers a node can...
0 votes
0 votes
1 answer
4
iita asked Feb 2, 2017
678 views
Which of the following relation can decompose into BCNF with dependency preserving and lossless join decomposition.(i) R(ABCDE) {AB → C, C → AB, C → D, D → E}(ii)...