The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+15 votes

Consider a schema $R(A,B,C,D)$ and functional dependencies $A \rightarrow B$ and $C \rightarrow D$. Then the decomposition of R into $R_1 (A,B)$ and $R_2(C,D)$ is

- dependency preserving and lossless join
- lossless join but not dependency preserving
- dependency preserving but not lossless join
- not dependency preserving and not lossless join

+23 votes

Best answer

+7 votes

A decomposition {R1, R2} is a lossless-join decomposition if **R1 ∩ R2 → R1 (R1 should be key) or R1 ∩ R2 → R2 (R2 should be key) **but (A,B) ∩ (C,D) = ∅ so lossy join

FD:1 A→B

FD:2 C→D

R1(A,B) have all attributes of FD1 and R2(C,D) have all attributes of FD2 so ,dependency preserved decompostion

Reference : - question no. 8.1 Korth http://codex.cs.yale.edu/avi/db-book/db6/practice-exer-dir/8s.pdf

- All categories
- General Aptitude 1.2k
- Engineering Mathematics 4.8k
- Digital Logic 2k
- Programming & DS 3.5k
- Algorithms 3k
- Theory of Computation 3.8k
- Compiler Design 1.5k
- Databases 2.8k
- CO & Architecture 2.5k
- Computer Networks 2.9k
- Non GATE 940
- Others 1.2k
- Admissions 320
- Exam Queries 409
- Tier 1 Placement Questions 17
- Job Queries 52
- Projects 8

34,170 questions

40,846 answers

115,883 comments

39,703 users