Register

database

• retagged by
820 views
1 1 vote

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 ?

1 Answer

Best answer
1 1 vote
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
Voting & Accepting an answer helps improve the community
← Previous · Computer Network - S...Next → · previous year questi...
← Previous in category · What is the minimum ...Next in category → · previous year questi...
Position:
Show:

Related questions

0 0 votes
0 0 answers
891
891 views
air1ankit asked Oct 27, 2017
891 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 ???
1 1 vote
2 2 answers
892
892 views
air1ankit asked Oct 17, 2017
892 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 questi...
0 0 votes
1 1 answer
1.5k
1.5k views
Abhishek tarpara asked Sep 17, 2021
1,499 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.
4 4 votes
2 2 answers
3.4k
3.4k views
go_editor asked Nov 20, 2020
3,363 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)$...