*Converting Multiway Relationships to Binary*

On April 06, 2013, In The Entity-Relationship Data Model by Admin

Views (441)

There are a number of data models, such as ODL (Object Definition Language), which we introduce in "Introduction to ODL", that limit relationships to be binary. Therefore, while the E/R model does not require binary relationships, it is helpful to watch that any relationship connecting more than two entity sets can be converted to a collection of binary, many-one relationships. We can introduce a new entity set

**Example :**The four-way Contracts relationship in "Roles in Relationships" figure, can be replaced by an entity set that we may also call Contracts. As seen in "Subclasses in the E/R Model" figure, it participates in four relationships. If the relationship set for the relationship Contracts has a 4-tuple

(studio1, studio2, star, movie)

Note that we have presumed there are no attributes of entity set Contracts, though the other entity sets in "Subclasses in the E/R Model" figure have unseen attributes. Nevertheless, it is possible to add attributes, such as the date of signing, to entity set Contracts.

### Tags

- entity set
- tuples
- multiway relationship
- Additional Constraint Examples
- Extending the Projection Operator
- Grouping
- Extended Operators of Relational Algebra
- Selection on Bags / Product of Bags / Joins of Bags
- Union, Intersection, and Difference of Bags
- Relational Operations on Bags
- Dependent and Independent Operations
- Selection / Cartesian Product
- Set Operations on Relations
- An Algebra of Relational Operations
- Relational Algebra
- Information Integration Via Semistructured Data
- Semistructured Data
- Nested Relations
- The Object-Relational Model
- Representing ODL Relationships
- Representing Other Type Constructors
- Nonatomic Attributes in Classes
- Declaring Keys in ODL
- Extents
- Additional ODL Concepts
- Relationships in ODL / Inverse Relationships
- The Type System
- Reasoning About Multivalued Dependencies
- Definition of Multivalued Dependencies
- Multivalued Dependencies
- Boyce-Codd Normal Form
- Decomposing Relations
- The Transitive Rule
- Why the Closure Algorithm Works
- Trivial Functional Dependencies
- Rules About Functional Dependencies
- Superkeys
- Keys of Relations
- Using Null Values to Combine Relations - Comparison of Approaches
- Converting Subclass Structures to Relations
- Handling Weak Entity Sets
- Combining Relations
- From Entity Sets to Relations
- From E/R Diagrams to Relational Designs
- Relation Instances
- Equivalent Representations of a Relation
- Tuples / Domains
- Attributes / Schemas
- Weak Entity Set Notation
- Requirements for Weak Entity Sets
- Weak Entity Sets
- Other Kinds of Constraints
- Referential Integrity in E/R Diagrams
- Referential Integrity
- Single-Value Constraints
- Representing Keys in the E/R Model
- Keys in the E/R Model
- The Modeling of Constraints
- Picking the Right Kind of Element
- Choosing the Right Relationships
- Simplicity Counts
- Avoiding Redundancy
- Design Principles
- Subclasses in the E/R Model
- Attributes on Relationships
- Roles in Relationships
- Multiway Relationships
- Multiplicity of Binary E/R Relationships
- Instances of an E/R Diagram
- Elements of the E/R Model
- Database System Implementation
- Database Design
- Multimedia Data
- Relational Database Systems