543 views
2 votes
2 votes

Which of the following is a minimal cover of the set of functional dependencies $\{A \rightarrow BC,
B \rightarrow CE,
A \rightarrow E,
AC \rightarrow H,
D \rightarrow B \}?$

  1. $\{A \rightarrow B,B \rightarrow C, B \rightarrow E, AC \rightarrow H, D \rightarrow B \}$
  2. $\{A \rightarrow B, B \rightarrow E, AC \rightarrow H, D \rightarrow B \}$
  3. $\{A \rightarrow BH,B \rightarrow CE, D \rightarrow B \}$
  4. $\{A \rightarrow B,B \rightarrow C, B \rightarrow E, A \rightarrow H, D \rightarrow B \}$

2 Answers

2 votes
2 votes

A set of functional dependencies $X$ is minimal if it satisfies the following conditions: 

  1. Every dependency in $X$ has a single attribute on its right-hand side.
  2. We cannot replace any dependency $A \to B$ in $X$ with dependency $C \to B,$ where $C$ is a proper subset of $A,$ and still have a set of dependencies that is equivalent to $X.$
  3. We cannot remove any dependency from $X$ and still have a set of dependencies that is equivalent to $X.$


Option C is violating condition $1$ and hence cannot be a minimal cover. (But condition 1 is only in Navathe and not in books like Korth. So, marks are given for both)

In option A, we have $AC \to H$ but since we have $A \to C,$ this implies $A \to H$ and thus violating condition $2.$ So, option A also is not a minimal cover.

In option B, condition $3$ is violated as $A\to C$ cannot be inferred.

Option D is a minimal cover.

Option C,D also gets mark. 

edited by
Answer:

Related questions

4 votes
4 votes
1 answer
2
gatecse asked Oct 8, 2020
363 views
From the following instance of a relation schema $R(A,B,C)$, we can conclude that:(Mark all the appropriate options)$$\begin{array}{|l|l|l|}\hline \textbf{A} & \textbf{B}...
1 votes
1 votes
1 answer
3
gatecse asked Oct 8, 2020
160 views
Given the following relation instance.$$\begin{array}{|l|l|l|}\hline \text{X} & \text{Y} & \text{Z} \\\hline \text{1} & \text{0} & \text{5} \\\text{2} & \text{1} & \text{...