• edited by
22,956 views
59 59 votes

Consider the following implications relating to functional and multivalued dependencies given below, which may or may not be correct.

  1. if $A \rightarrow \rightarrow B$ and $A \rightarrow \rightarrow C$ then $A \rightarrow  BC$
  2. if $A \rightarrow B$ and $A \rightarrow  C$ then $A \rightarrow \rightarrow BC$
  3. if $A \rightarrow \rightarrow BC$ and $A \rightarrow  B$ then $A \rightarrow C$
  4. if $A \rightarrow BC$ and $A \rightarrow  B$ then $A \rightarrow \rightarrow C$

Exactly how many of the above implications are valid?

  1. $0$
  2. $1$
  3. $2$
  4. $3$

9 Answers

Best answer
55 55 votes

a. If $A → → B$ and $A  → →C$ then$ A → BC$ . So FALSE
b. If $A → B$ and $A → C$ then $A→ BC.$   So   $A → →BC$    TRUE..
c. If $A → → BC$ and $A → B$  here $B$ is Subset of $AB$ and ($A$ intersection $BC$) is phi so
 $A → B$but not $A → C$ so FALSE  (Coalescence rule )
d. If $A → BC$  then$ A → C $  so $ A → → C$    TRUE
 if $A → B$ then$ A → → B$  holds but reverse not true.

Correct Answer: $C$

• edited by
16 16 votes

Every FD is a MVD.

i.e suppose $x\rightarrow y$  $\Rightarrow$ $x\rightarrow \rightarrow y$

If y can be determined by x on y's single value then we can easily say x multi-determines y. as single value $\subseteq$ multiple value.

Now,

1. can't even possible.

2.  A -> BC which implies A -> -> BC. (true)

3. using given data we can't prove the then part.

4. given FDs are A->B & A->C, so using this we can say A->->C.(true)

here 2 implications are valid. i.e option C

5 5 votes

We know that, if  x->y exist in a retation then x->->y must be exixt in that relationship. But if x->->y exists then x->y may or may not be exists in the relation.

Option 1: if A->->B and  A->->C then there are no guarantees that A->B & A->C (A->BC) exist. Then it is a invaild implication.

Option 2: if A->B and A->C then using union we can say that A->BC then A->->BC must exist. Then it is a vaild implication.

Option 3: if A->->BC exist then there are no guarantee about A->BC then A->B and A->C is invaid implication.

Option 4:  if A->BC exist then using decomposition or spiliting we can say that A->B abd A->C also exist. For exixtance of A->C, A->->C  also exixts. this is also valid implication.

Overall 2 implication are valid .Ans-C

1 1 vote

 

Every Functional Dependency is MutliDependency, but converse is not true.So,every rule of functional Dependency can apply to Multi Dependencies.

B is   (Union) and D is  (decomposition) are ensure the functional Dependencies so theyare also Mutli dependencies. Therefore 2 and 4 can hold the result.

0 0 votes

Implication 1 (A →→ B and A →→ C, then A → BC) is valid.

  • If A multidetermines both B and C independently, it implies that for a given value of A, B and C can have multiple, independent values. This effectively means A functionally determines the combined set of values for B and C.
    ans is B
Answer:
Position:
Show:

Related questions

0 0 votes
0 0 answers
545
545 views
admin asked Jul 28, 2023
545 views
Consider the following statements:A database design is in BCNF if each member of the set of relation schemas that constitutes the design is in BCNFA BCNF schema can have ...
61 61 votes
5 answers 5 answers
35.5k
35.5k views
Ishrat Jahan asked Oct 30, 2014
35,461 views
Consider the $B^{+}$ tree in the adjoining figure, where each node has at most two keys and three links.Keys $K15$ and then $K25$ are inserted into this tree in that orde...
67 67 votes
5 answers 5 answers
25.6k
25.6k views
Ishrat Jahan asked Oct 30, 2014
25,597 views
Consider the $B^+$ tree in the adjoining figure, where each node has at most two keys and three links.Keys $K15$ and then $K25$ are inserted into this tree in that order....
88 88 votes
5 answers 5 answers
22.3k
22.3k views
Ishrat Jahan asked Oct 30, 2014
22,315 views
Consider the following relation schemas :b-Schema = (b-name, b-city, assets)a-Schema = (a-num, b-name, bal)d-Schema = (c-name, a-number)Let branch, account and depositor ...