closed by
540 views
1 votes
1 votes
closed as a duplicate of: GATE CSE 2002 | Question: 2.24
Relation R is decomposed using a set of functional dependency F, and relation S is decomposed using another set of functional dependencies G. One decomposition is definitely BCNF, the other is definitely 3NF, but is not known to make a guaranteed identification. Which of the following tests should be used for the decomposition? (Assume that closure of F and G are available)  

A. Dependency preservation

B. BCNF definition

C. Both (A) and (B)

D. 3NF definition

I think D should be most appropriate answer but answer key has given it B.
closed by

Related questions

2 votes
2 votes
2 answers
2
gatecrack asked Dec 10, 2018
582 views
Is minimal set of functional dependency for a functional dependency set is always unique???
0 votes
0 votes
1 answer
3
Raghav Khajuria asked Oct 5, 2018
884 views
Difference between composite and compound key??
1 votes
1 votes
0 answers
4
iarnav asked Nov 24, 2017
740 views
consider:T1: {A11, A12, A13} - key is A11T2: {A21, A22, A11} - key is A21T3: {A21, A23} - key is {A21 A23}T1, T2, T3 all are in which normal form? a) 2nfb) 3nfc) BCNFFUNC...