recategorized by
113 views
0 votes
0 votes

The decomposition of a relation R of relational DBMS into two relations $RI(X)$ & $R2(Y)$ is lossless if

  1. $X \cap Y > X-Y \text{ or } X \cap Y > Y-X \text{ is in }F^+$
  2. $X – Y > X \cup Y \text{ or } Y – X > X \cup Y \text{ is in }F^+$
  3. $X \cap  Y > X – Y \text{ and } X \cap Y > Y – X \text{ are in }F^+$
  4. $X – Y > X \cup Y \text{ and } Y – X > X \cup Y \text{ are in }F^+$

Here $>$ means determines, $F^+$ is closure of functional dependencies and $X, \: Y$ are set of attributes present in $R1$ & $R2$  respectively. 

recategorized by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
gatecse asked Aug 4, 2019
295 views
In relational DBMS, the closure of functional dependencies facilitates To determine the candidate key To determine the foreign key To determine the dependency of an attr...
0 votes
0 votes
1 answer
2
gatecse asked Aug 4, 2019
326 views
The schema for the entire database is designed using Data definitional languageStructured query languageData manipulation language Schema structure language
0 votes
0 votes
0 answers
3
gatecse asked Aug 4, 2019
232 views
The Software Development Life Cycle (SDLC) is used in allProcess modelsDesign modelsProgramming modelsNone of these
0 votes
0 votes
0 answers
4
gatecse asked Aug 4, 2019
247 views
The complexity of algorithms is comparatively more accurate in the use ofAsymptotic analysisAmortized analysisBoth of theseNot dependent on the nature of analysis.