Register

database

• retagged by
425 views
1 votes
1 votes

For relation R=(L, M, N, O, P), the following dependencies hold:

M→O, NO→P, P→Land L→MN

R is decomposed into R1 = (L, M, N, P) and R2 = (M, O).What is the highest normal form satisfied by the above decomposition?

My doubt is For R1 it is in 2NF and R2 it is in BCNF .But ,dependency preserving also violates .So whts the highest normal form ?

• retagged by
User Avatar

1 Answer

Best answer
1 votes
1 votes
Yes, Decomposition is BCNF because in relation R1, all attributes L,MN, and P are C.K.
R2 is a binary relation hence it has to be BCNF
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
air1ankit asked Oct 27, 2017
476 views
Database #1NF
R(ABCDE) { A,BC,CD} are candidate key of relation R after 1 NF design which one is possible multi valued attributes before 1 NF design ???
R(ABCDE) { A,BC,CD} are candidate key of relation R after 1 NF design which one is possible multi valued attributes before 1 NF design ???
User Avatar
1 votes
1 votes
2 answers
2
air1ankit asked Oct 17, 2017
469 views
Database
1- R(ABCD) FD'S ARE {AB->C ,C->D,D->EA ,DE->F,EF->B} 2-R(ABCD) FDS ARE { A->BC, CD->E, B->D,E-A} 3- R(ABCD) {AB-> CD,C->B,D->C} Find the candidate key ??? For above questions and please explain too.
1- R(ABCD) FD'S ARE {AB->C ,C->D,D->EA ,DE->F,EF->B}2-R(ABCD) FDS ARE { A->BC, CD->E, B->D,E-A}3- R(ABCD) {AB- CD,C->B,D->C} Find the candidate key ??? For above questi...
User Avatar
0 votes
0 votes
1 answer
3
Abhishek tarpara asked Sep 17, 2021
922 views
#DBMS #dependency
What is the number of redundent FD’s possible for given set of FD , A->B, B->C,C->D for relation R(ABCD)?? please explain in detail.
What is the number of redundent FD’s possible for given set of FD , A->B, B->C,C->D for relation R(ABCD)?? please explain in detail.
User Avatar
3 votes
3 votes
2 answers
4
go_editor asked Nov 20, 2020
2,310 views
UGC NET CSE | October 2020 | Part 2 | Question: 14
Consider a relational schema $S=(U,V,W,X,Y,Z)$ on which the following functional dependencies hold: $(U \rightarrow V, VW \rightarrow X, Y \rightarrow W, X \rightarrow U)$ Which are the candidate keys among following options? $UY, VY$ $UY, VY, XY$ $UYZ, VYZ, VWZ$ $UYZ, VYZ, XYZ$
Consider a relational schema $S=(U,V,W,X,Y,Z)$ on which the following functional dependencies hold:$(U \rightarrow V, VW \rightarrow X, Y \rightarrow W, X \rightarrow U)$...
User Avatar
Link Copied!