b) Transitivity and Augmentation rules of Functional Dependency allow arrow entering Mothers from Births. However, a new relationship in below figure represents more accurate information.
c)
Design flaws in abc above 1. As suggested above, using Transitivity and
Augmentation rules of Functional Dependency, much simpler design is possible.
4.2.7
In below figure there exists a many-to-one relationship between Babies and Births and another many-to-one relationship between Births and Mothers. From transitivity of relationships, there is a many-to-one relationship between Babies and Mothers. Hence a baby has a unique mother while a birth can allow more than one baby.
4.3.1 a)
b)
A captain cannot exist without a team. However a player can (free agent). A recently formed (or defunct) team can exist without players or colors.
c)
Children can exist without mother and father (unknown).
4.3.2 a)
The keys of both E1 and E2 are required for uniquely identifying tuples in R b)
The key of E1 c)
The key of E2 d)
The key of either E1 or E2
4.3.3
Special Case: All entity sets have arrows going into them i.e. all relationships are 1-to-1
Any Ki
Otherwise: Combination of all Ki's where there does not exist an arrow going from R to Ei.
4.4.1
No, grade is not part of the key for enrollments. The keys of Students and Courses become keys of the weak entity set Enrollments.
4.4.2
It is possible to make assignment number a weak key of Enrollments but this is not good design (redundancy since multiple assignments correspond to a course). A new entity set Assignment is created and it is also a weak entity set. Hence the key attributes of Assignment will come from the strong entity sets to which Enrollments is connected i.e. studentID, dept, and CourseNo.