Register

Recent questions tagged lossless-join

2 2 votes
1 1 answer
129
129 views
GO Classes DPP | GATE CS, DA | DBMS | Dependency Preservation
Consider $R(A,B,C,D,E)$ with $F=\{A\to DE,\ BE\to C,\ D\to B,\ C\to A\}$.The relation is decomposed into $R_1(A,B,C)$ and $R_2(A,D,E)$.Which of the following statements a...
User Avatar
2 2 votes
1 1 answer
117
117 views
GO Classes DPP | GATE CS, DA | DBMS | Lossless Decomposition
Consider $R(A,B,C,D,E,F)$ with $F=\{C\to D,\ A\to B,\ B\to EF,\ F\to A\}$.Suppose $R$ is decomposed into $R_1(A,B,D,E)$ and $R_2(A,B,C,F)$. The decomposition is currently...
User Avatar
1 1 vote
1 1 answer
105
105 views
GO Classes DPP | GATE CS, DA | DBMS | Binary Decomposition
Consider the binary decomposition$R(A,B,C,D)\to R_1(A,C,D),R_2(B,C)$.Which of the following statements are correct?If $C$ is a candidate key for $R_1$, the decomposition ...
User Avatar
3 3 votes
1 1 answer
256
256 views
GO Classes DPP | GATE CS, DA | DBMS | Dependency Preservation
Consider $X(A,B,C,D,E,F)$ with $F=\{AB\to CD,\ CD\to EF\}$.The relation is decomposed into $X_1(A,B,C,D)$ and $X_2(C,D,E,F)$.Which statement is correct?The decomposition ...
User Avatar
0 0 votes
0 0 answers
554
554 views
UGC NET CSE | June 2023 | Part 2: 48
Consider the following statements:A database design is in BCNF if each member of the set of relation schemas that constitutes the design is in BCNFA BCNF schema can have ...
User Avatar
2 2 votes
0 0 answers
886
886 views
UGC NET CSE | June 2023 | Part 2: 65
let $\text{R ( A,B,C, D)}$ be a relational schema with following function dependencies:$\mathrm{A} \rightarrow \mathrm{B}, \mathrm{B} \rightarrow \mathrm{C}$$\mathrm{C} \...
User Avatar
4 4 votes
1 answers 1 answer
1.5k
1.5k views
NIELIT 2022 April Scientist B | Section B | Question: 49
Let $\text{R (A, B, C, D)}$ be a relational schema with the following functional dependencies: $\text{A} \rightarrow \text{B, B} \rightarrow \text{C}$ $\text{C} \rightar...
User Avatar
2 2 votes
2 2 answers
1.3k
1.3k views
Self doubt dbms Normalisation
Is minimal set of functional dependency for a functional dependency set is always unique???
User Avatar
3 3 votes
1 1 answer
1.1k
1.1k views
Gateforum Test series
User Avatar
2 2 votes
1 1 answer
4.5k
4.5k views
Gateforum DBMS
User Avatar
2 2 votes
1 1 answer
2.2k
2.2k views
Lossless join
User Avatar
0 0 votes
0 0 answers
778
778 views
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 has to be key in ...
User Avatar
1 1 vote
2 2 answers
1.2k
1.2k views
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\ ...
User Avatar
4 4 votes
1 answers 1 answer
1.7k
1.7k views
Test by Bikram | Mock GATE | Test 4 | Question: 10
Consider the relation $R(X\;Y\;W\;M\;E\;G),$with $FD$ set $\{XY \rightarrow W, E \rightarrow G, XW \rightarrow Y, YW \rightarrow X, Y \rightarrow M, XM \rightarrow E \}....
User Avatar
0 0 votes
1 1 answer
1.1k
1.1k views
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, C) = {B,C} IS LOSSL...
User Avatar
0 0 votes
1 1 answer
555
555 views
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
0 0 votes
1 answers 1 answer
467
467 views
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⋂...
User Avatar
3 3 votes
4 4 answers
2.1k
2.1k views
DBMS-Normalisation-Lossless Join Decomposition
User Avatar
0 0 votes
1 answers 1 answer
2.5k
2.5k views
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"={ DI...
User Avatar
4 4 votes
1 answers 1 answer
1.4k
1.4k views
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$^+$ ORR1 $\cap$ R2 $\rightarrow$ R2 $\in...
User Avatar
To see more, click for the full list of questions or popular tags.