950 views
1 1 vote

Consider the table:-

A         |  B 

a         |  2

b         |  a

c         |  4

NULL  |  6

NULL  |  6

determine whether F.D. holds for A-->B  and/or B-->A?and How?

1 Answer

Best answer
6 6 votes
We can only be sure whether the FD does not  hold and we can never be sure whether the FD can hold as the values may be differ after insertion(not for instance). So here in the question in this particular instance, A->B can hold as the values in A are different and if both null values are same then also the value in the corresponding B is same(6) and if the value turned out to be different then no issue. So A->B holds. But B->A doesn't hold cause if both the null values turned out to be different (NULL values do not compare equal in SQL) then it will fail..
• edited by
Position:
Show:

Related questions

3 3 votes
3 3 answers
4.3k
4.3k views
shiva asked Dec 25, 2015
4,252 views
For which of the following set of functions dependencies does the relation $R(A, B, C, D)$ has $AB, CD$ as closed sets?$A \rightarrow B, B \rightarrow A, C \rightarrow D$...
6 6 votes
3 answers 3 answers
15.1k
15.1k views
amarVashishth asked Jul 25, 2015
15,070 views
Consider the following set of functional dependency on the scheme (A, B,C)A→BC, B→C, A→B, AB→CThe canonical cover for this set is:A. A→BC and B&r...
4 4 votes
1 answers 1 answer
15.6k
15.6k views
nitin.nilesh asked Sep 22, 2014
15,597 views
Consider table R(A,B,C,D,E) with FDs as A->B, BC->E and ED- A. The table is in which normal form? Justify your answer.
2 2 votes
2 2 answers
740
740 views
radha gogia asked Sep 3, 2015
740 views
why can't we say that A functionally determines B from the given relation instance when it satisfies the constraints since for unique value of A we have unique value of B...