Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
0 votes
A relation R (ABCDE) with functional dependency

F= {AB ->CD, A->E, C->D}

 The decomposition of R into R1(ABC), R2(BCD) and R3(CDE)

 (i) lossless join

(ii) lossy decomposition

 (iii) dependency preserving

 (iv) not dependency preserving

(A) i & ii

(B) i & iv

(C) ii & iii

 (D) ii & iv
in Databases 15 points 10 views

1 Answer

0 votes

AB->D and A->E  are not preserved .

In none of the decomposed tables , common attribute is a candidate key , so lossy decomposition .


option D

11 points