in Databases
374 views
0 votes
0 votes
Consider a schema R (A, B, C, D, E, F) and functional dependencies are
A → B, C → D, B → E
Which is divided into R, (A, B, E), R2 (C, D, E) then decomposition?
(1) Dependency preserving and loss Join
(2) Loss less join but not dependency preserving
(3) Dependency preserving but not loss join
(4) Not dependency preserving and not loss Join
in Databases
374 views

1 Answer

2 votes
2 votes
Best answer

F={A->B,C->D,B->E}

Lossless Join:

R1(ABE) AND R2(CDE)

(R1 $\bigcap$ R2)^+=R1 OR R2 Then it is lossless join dependecy.

R1 $\cap$ R2=$E^{+}$ which is not R1 or R2.

Hence it is lossy join dependency.

Dependency preserving:

R1(ABE) ---A->BE,B->E,AB->E

R2(CDE)---C->D.

R={A->BE,B->E,AB->E,C->D}

F=R .

Hence it is dependecy preserving.

Hence it is lossy join and dependecy preserving.Option '3' is correct.

selected by

4 Comments

i think it is lossy , because the common Field "E" is not primary key in any of the decomposed table.

Correct me...

so it should be lossy and it is obviously dependency preserving.
0
0
i am also saying it is lossy join.
0
0
so option 1 should be right?? but you said option 3 is right.
0
0
it is dependecy preserving and not lossless join.so option 3 is correct.
0
0