Given the relation R(ABCDEF) and the functional dependency set F = {B D, E F, DE,...

 

Transcribed Image Text:

Given the relation R(ABCDEF) and the functional dependency set F = {B D, E F, DE, D B, F BD}. 1. Is the decomposition ABDE, BCDF lossless? If not, what functional dependency could you add to make it lossless? 2. Is it dependency preserving? If not, what functional dependency could you add to make it dependency preserving? Given the relation R(ABCDEF) and the functional dependency set F = {B D, E F, DE, D B, F BD}. 1. Is the decomposition ABDE, BCDF lossless? If not, what functional dependency could you add to make it lossless? 2. Is it dependency preserving? If not, what functional dependency could you add to make it dependency preserving?

Answer rating: 100% (QA)

Lets analyze the decomposition of the relation RABCDEF into ABDE and BCDF and check if it is lossles... View the full answer