Representation of Relationship Sets

next up previous
Next: Generalization Up: Reducing E-R Diagrams Previous: Representation of Weak

Representation of Relationship Sets

Let R be a relationship set involving entity sets .

The table corresponding to the relationship set R has the following attributes:

If the relationship has k descriptive attributes, we add them too:

An example:

Non-binary Relationship Sets

The ternary relationship of Figure 2.13 gives us the table of figure 2.18. As required, we take the primary keys of each entity set. There are no descriptive attributes in this example.

Linking a Weak to a Strong Entity

These relationship sets are many-to-one, and have no descriptive attributes. The primary key of the weak entity set is the primary key of the strong entity set it is existence-dependent on, plus its discriminator.

The table for the relationship set would have the same attributes, and is thus redundant.

Page created and maintained by Osmar R. Zaï ane
Last Update: Sun Sep 10 17:02:35 PDT 1995