Is the answer option 3?

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

PLEASE SOMEONE EXPLAIN ME THAT WHY 2ND OPTION IS TRUE ? I AM NOT GETTING THIS OPTION HELP ME

R(A,B,C,D) is a relation. Which of the following does not have a lossless join, dependency preserving BCNF decomposition?

- A→B,B→CD
- A→B,B→C,C→D
- AB→C,C→AD
- A→BCD

+1

The BCNF decompostion of option 2 will be R1(A,B), R2(B,C) and R3(C,D).

We can see that these three relations are lossless (by drawing table).For dependency preserving, from R1 er get the fd A->B, from R2 we get B->C and from R3 we get C->D.Thus we can obtain all the FDs and hence the relation is dependency preserving

We can see that these three relations are lossless (by drawing table).For dependency preserving, from R1 er get the fd A->B, from R2 we get B->C and from R3 we get C->D.Thus we can obtain all the FDs and hence the relation is dependency preserving

- All categories
- General Aptitude 1.4k
- Engineering Mathematics 5.9k
- Digital Logic 2.3k
- Programming & DS 4.3k
- Algorithms 3.7k
- Theory of Computation 4.6k
- Compiler Design 1.7k
- Databases 3.4k
- CO & Architecture 2.9k
- Computer Networks 3.4k
- Non GATE 1.2k
- Others 1.3k
- Admissions 506
- Exam Queries 482
- Tier 1 Placement Questions 22
- Job Queries 64
- Projects 16

40,928 questions

47,581 answers

146,441 comments

62,311 users