| |
comp.databases.theory |
> My problem is with the notation for a particular Ternary relationship.
> (Supertype) [Parent]------[0..*]----- <Breeding>
> ----[1..1]--------[Child](subtype)
> |-------------[0..*]------------|
- Each Parent participates in zero or more instances of that
relationship.
Minor detail: if *every* child has two parents your database will
either be infinite or some will be their own descendants.
> (Supertype) [Parent]------1-----
> <Breeding>-----M-------[Child](subtype)
> |-------------1------------|
So let's look at Child. Given two particular parents what is the upper
bound on the number of children. There is no upperbound so the edge
Breeding--Child is annotated with N. Let's look at Parent1. Given
Parent2 and a child is there un upper bound on the number of associted
Parent1's? Yes, there can be at most one, (in fact, this is already the
case just for Child) so we annotate the edge Breeding--Parent(1) with
1.
Clear?
-- Jan Hidders