Consider an Entity-Relationship (ER) model in which entity sets E1 and E2 are connected by an m : n relationship R12. E1 and E3 are connected by a 1 : n (1 on the side of E1 and n on the side of E3) relationship R13.
E1 has two single-valued attributes a11 and a12 of which a11 is the key attribute. E2 has two single-valued attributes a21 and a22 of which a21 is the key attribute. E3 has two single-valued attributes a31 and a32 of which a31 is the key attribute. The relationships do not have any attributes.
If a relational model is derived from the above ER model, then the minimum number of relations that would be generated if all the relations are in 3NF is _______.
$$S1:$$ Every table with two single-valued attributes is in $$1NF, 2NF, 3NF$$ and $$BCNF.$$
$$S2:$$ $$AB \to C,\,\,D \to E,\,\,E \to C$$ is a minimal cover for the set of functional dependencies $$AB \to C,$$ $$D \to E,\,\,AB \to E,\,\,E \to C.$$
Which one of the following is CORRECT?
$$F = \left\{ {CH \to G,\,\,A \to BC,\,B \to CFH,\,\,E \to A,\,\,F \to EG} \right\}$$ set of functional dependencies $$(FDs)$$ so that $${F^ + }$$ is exactly the set of $$FDs$$ that hold for $$R.$$
How many candidate keys does the relation $$R$$ have?
$$F = \left\{ {CH \to G,\,\,A \to BC,\,B \to CFH,\,\,E \to A,\,\,F \to EG} \right\}$$ set of functional dependencies $$(FDs)$$ so that $${F^ + }$$ is exactly the set of $$FDs$$ that hold for $$R.$$
The relation $$R$$ is