1,533 views
0 votes
0 votes
Tell whether the following decomposition of relations lossless and dependency preserving or not.

1. R(ABCDEFGHIJ)  and FD sets

AB->C,  A->DE, B->F, F->GH, D->IJ

a)  D1"={ DIJ, ACE, FGH, BF, ADC}

b)  D2={ FGH, DIJ, ADEBF, ABC}

2.R(ABCDEG) and FD sets

AB->C, AC->B, AD->E, B->D, BC->A, E->G

a)  D=( ABC, ACDE, ADG)

1 Answer

Best answer
3 votes
3 votes

F={AB->C,A->DE,B->F,F->GH,D->IJ}

D1={DIJ,ACE,FGH,BF,ADC}

CANDIDATE KEY FOR 1ST RELATION IS (AB)

THERE IS COMMON ATTRIBUTE OF (AB) FOR ALL DECOMPOSITION RELATIONS

SO IT IS LOSSY JOIN 

dependencies correspanding D1 realtions are

D->IJ,A->E,AC->E,F->GH,B->F,A->D

check D1 covers F are not?

(AB)+ is not derive C

so not dependecy preservation

@)D2={FGH,DIJ,ADEBF,ABC)

IT IS LOSSLESS JOIN DEPENDENCY

dependencies are

D2={F->GH,D->IJ,AB->D,AB->E,AB->F,B->F,A->DE,A->BC}

it satisfies F covers D2 and D2 covers F 

so it is dependency preserving.

3)R(ABCDEG)

F={AB->C,AC->B,AD->E,B->D,BC->A,E->G}

it is lossless join dependency.

D3={AB->C,BC->A,AC->B,AC->D,AC->E,AD->E,AD->G}

check Fcovers D3 are not?

D3 NOT COVERS F because (E)+ not derive G

so not dependecy preservation

Related questions

2 votes
2 votes
2 answers
1
gatecrack asked Dec 10, 2018
581 views
Is minimal set of functional dependency for a functional dependency set is always unique???
3 votes
3 votes
4 answers
2
1 votes
1 votes
1 answer
4
Mk Utkarsh asked Jan 12, 2018
978 views