Register

Recent questions tagged lossless-join

1.1k
views
1 answers
2 votes
NIELIT 2022 April Scientist B | Section B | Question: 49
Let $\text{R (A, B, C, D)}$ ... join, but is dependency preservingdoes not give a lossless join and is not dependency preserving
User Avatar
657
views
2 answers
2 votes
Self doubt dbms Normalisation
Is minimal set of functional dependency for a functional dependency set is always unique???
User Avatar
536
views
1 answers
3 votes
Gateforum Test series
User Avatar
1.6k
views
1 answers
2 votes
Gateforum DBMS
User Avatar
1.1k
views
1 answers
1 votes
Lossless join
User Avatar
520
views
0 answers
0 votes
DBMS Losless join
R is divided into R1 and R2 ,but since there is no common attribute in R1 and R2, so it should form lossy join,as for loseless join the common attribute ... .But here the image above,it is comming as loseless join.Can someone please check?
User Avatar
647
views
2 answers
1 votes
lossless join
$R(X,Y,Z,W) is\ decomposed\ into \\ R_1(X,Y)\\ R_2(Y,Z)\\ R_3(Y,W).\\The\ FDs\ are\ :\\ X -> Y,\\ Z->Y,\\ Y->W \\ Find\ whether\ the\ decomposition\ is\ lossless\ or\ lossy\ ?$
User Avatar
790
views
1 answers
4 votes
Test by Bikram | Mock GATE | Test 4 | Question: 10
Consider the relation $R(X\;Y\;W\;M\;E\;G),$with $FD$ ... $P_2$ are lossless-join decompositions.$P_1$ is lossless-join decomposition but not $P_2$.
User Avatar
688
views
1 answers
0 votes
Testing Lossless join
State true or false:-Symbol " ^ " stands for an intersection AND letters in bold are the candidate key of the respective table.1) R1(A, B, C) ^ R2(B ... , tell what will be the candidate key after performing join each time and at the end.
User Avatar
450
views
2 answers
4 votes
cil-2017 Q87
User Avatar
344
views
1 answers
0 votes
Lossless or Lossy (Explain with help of table drawing, if possible)
R(ABCDEG) and FD sets {AB->C, AC->B, AD->E, B->D, BC->A, E->G} D=( ABC, ACDE, ADG)
User Avatar
267
views
1 answers
0 votes
self_doubt
If a relation is decomposed into more than two relations then what is the correct method to check whether the decomposition is lossless or not? Can we use R1⋂R2→R1 or R1⋂R2→R2 pairwise for the decomposition or is there any other method?
User Avatar
1.2k
views
4 answers
3 votes
DBMS-Normalisation-Lossless Join Decomposition
User Avatar
1.7k
views
1 answers
0 votes
Database mgmt system
Tell whether the following decomposition of relations lossless and dependency preserving or not.1. R(ABCDEFGHIJ) and FD setsAB->C, A->DE, B->F, F->GH, D->IJa) D1"={ DIJ, ACE, FGH, ... ->B, AD->E, B->D, BC->A, E->Ga) D=( ABC, ACDE, ADG)
User Avatar
1.1k
views
1 answers
4 votes
Checking for lossless-join property
The decomposition of relation R with FD set F into R1 and R2 has lossless join property iffR1 $\cap$ R2 $\rightarrow$ R1 $\in$ F$^+$ ... check for lossless join property ?Answers with reference(s) will be much appreciated. Thanks.
User Avatar
To see more, click for the full list of questions or popular tags.