edited by
24,283 views
96 96 votes

The following functional dependencies hold true for the relational schema $R\left \{V,W,X,Y,Z \right \}$:

  • $V \rightarrow W$
  • $VW \rightarrow X$
  • $Y \rightarrow VX$
  • $Y \rightarrow Z$

Which of the following is irreducible equivalent for this set of functional dependencies?

  1. $V \rightarrow W$
    $V \rightarrow X$
    $Y \rightarrow V$
    $Y \rightarrow Z$
  2. $V \rightarrow W$
    $W \rightarrow X$
    $Y \rightarrow V$
    $Y \rightarrow Z$
  3. $V \rightarrow W$
    $V \rightarrow X$
    $Y \rightarrow V$
    $Y \rightarrow X$
    $Y \rightarrow Z$
  4. $V \rightarrow W$
    $W \rightarrow X$
    $Y \rightarrow V$
    $Y \rightarrow X$
    $Y \rightarrow Z$

3 Answers

Best answer
90 90 votes

In option $B$ and option $D$ there is a dependency $W\to X$ which is not implied by the question and hence they are definitely wrong.

Now in option $C)$ $Y\to X$ can be removed as it can be implied as $Y\to V$ and $V\to X$.

Hence, option (A) is correct.

edited by
Answer:
Position:
Show:

Related questions

73 73 votes
5 answers 5 answers
21.8k
21.8k views
Arjun asked Feb 14, 2017
21,836 views
Consider a database that has the relation schema CR(StudentName, CourseName). An instance of the schema CR is as given below.$$\begin{array}{|c|c|} \hline \textbf{Student...
125 125 votes
5 answers 5 answers
43.4k
43.4k views
Arjun asked Feb 14, 2017
43,354 views
In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let $TS(T_{1})$ and $TS(T_{2})$ be the timestamps of transactions ...
71 71 votes
7 answers 7 answers
38.0k
38.0k views
Arjun asked Feb 14, 2017
38,024 views
Consider a database that has the relation schemas EMP(EmpId, EmpName, DeptId), and DEPT(DeptName, DeptId). Note that the DeptId can be permitted to be NULL in the relatio...
89 89 votes
12 answers 12 answers
28.6k
28.6k views
Arjun asked Feb 14, 2017
28,593 views
A cache memory unit with capacity of $N$ words and block size of $B$ words is to be designed. If it is designed as a direct mapped cache, the length of the $\textsf{TAG}$...