Register

3nf decomposition

916 views
2 votes
2 votes
Consider R(ABCDEF) with following fd

AB->CDEF

C->A

D->B

C->D

E->F

B->E

Decompose it into 3NF
User Avatar

3 Answers

0 votes
0 votes

i think it ll help u..

User Avatar
0 votes
0 votes
R1(ABCD) AB->CD, C->A, C->D and D->B will imply in this decomposition

R2(BE) B->E will imply in this decomposition

R3(EF) E->F will imply in this decomposition.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.4k
views
0 answers
2 votes
Kapil asked Nov 20, 2016
1,395 views
DBMS Decomposition into 3NF and BCNF
Suppose a relation is given $R\left ( ABCDEF \right )$ with the given set of FD's$\left \{ A \rightarrow BCD, BC\rightarrow DE, B\rightarrow D,D\rightarrow A \right \}$A)...
User Avatar
625
views
2 answers
1 votes
GateAspirant999 asked Nov 12, 2016
625 views
Finding if decomposition is in 3NF
Consider the relation $R(A,B,C,D,E)$ with $FD\{ A\rightarrow C, D\rightarrow CE\} $. Which of the following decomposition is in 3NF?(A) $R_1(A,C); R_2(B,E); R_3(A,B,D)$(B...
User Avatar
609
views
2 answers
0 votes
Souvik33 asked Jan 14, 2023
609 views
Made Easy Test Series | 3NF | True/False
A relation is in 3NF if every non-prime attribute of R is fully functionally reliant on every key of RTRUEFALSE
User Avatar
376
views
0 answers
2 votes
h4kr asked Dec 15, 2022
376 views
Since it is already in 3NF, why decompose further?
Since the schema is already in 3NF we can keep the relations to 1, cant we? If you think the answer is different please explain how
User Avatar
Link Copied!