Register

Sel doubt

3,044 views
1 1 vote

Relation R (A,B,C,D,E,F)

Functional dependency:  ABC -->DEF,    BC-->EF,  EF-->D.

Decomposition: R1 (ABCDF), R2 (BCDE).  Is this decomposition lossy?

Is this decomposition preserve functional dependency?

Plz explain how to check functional dependency is preserved or not in decomposition.

 

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Ace test seriesNext → · UPPCL
← Previous in category · Self Doubt on serial...Next in category → · Madeeasy DBMS- 2PL-2...
Position:
Show:

Related questions

2 2 votes
2 2 answers
1.3k
1.3k views
gatecrack asked Dec 10, 2018
1,324 views
Self doubt dbms Normalisation
Is minimal set of functional dependency for a functional dependency set is always unique???
1 1 vote
1 1 answer
2.0k
2.0k views
Durgesh Singh asked May 1, 2018
2,022 views
Self - Doubt : How to calculate candidate keys in decomposed Relation?
For relation R=(L, M, N, O, P), the following dependencies hold and R is decomposed into R1 = (L, M, N, P) and R2 = (M, O). How to calculate what candidate keys are there...
1 1 vote
1 1 answer
688
688 views
Akash_Banik asked Oct 28, 2024
688 views
Database Normalization and 2nf
why is prime->prime dependency doesn't violates 2nf . say table(a,b,c,d,e) and {(a,b),(d,e)} are candidates key and there is a relation from a->d. does it follow function...