Question: consider the schema R = (A,B,C,D,E) and the following set F of functional dependencies holds on R: A ->BC CD -> E B -> D

consider the schema R = (A,B,C,D,E) and the following set F of functional dependencies holds on R:

A ->BC

CD -> E

B -> D

E->A

Suppose that we decompose the relation schema R into R3 = (A, B, C) and R4 = (C, D, E) . Show that this decomposition is not a lossless-join decomposition.

Hint: Give an example of a relation r on schema R such that

r != A,B,C (r) C,D,E(r)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!