recategorized by
805 views
1 votes
1 votes

Consider the schema $R=(\text{S T U V})$ and the dependencies $ S \rightarrow T, T \rightarrow U, U \rightarrow V$, and  $V \rightarrow S.$ If $R=(R1 \text{ and } R2)$ be a decomposition such that $R1 \cap R2= \phi$ then decomposition is

  1. not in $\text{2 NF}$
  2. in $\text{2 NF}$ but not in $\text{3 NF}$
  3. in $\text{3 NF}$ but not in $\text{2 NF}$
  4. in  both $\text{2 NF}$ and $\text{3 NF}$
recategorized by

1 Answer

Answer:

Related questions

2 votes
2 votes
2 answers
1
admin asked Apr 2, 2020
4,901 views
A functional dependency of the form $x\to y$ is trivial if$y\subseteq x$$y\subset x$$x\subseteq y$$x\subset y\:\text{and}\:y\subset x$
1 votes
1 votes
2 answers
2
3 votes
3 votes
4 answers
3
admin asked Apr 2, 2020
2,358 views
Every Boyce-Codd Normal Form (BCNF) decomposition isdependency preservingnot dependency preservingneed be dependency preservingnone of these
2 votes
2 votes
5 answers
4
admin asked Apr 2, 2020
1,367 views
A primary key, if combined with a foreign key createsparent child relationship between the tables that connect themmany-to-many relationship between the tables that conne...