A FUNDAMENTAL CLASSIFICATION OF RELATIONSHIPS IN RELATIONAL DATABASES

Date
1987-05-01
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
A fundamental classification is proposed for the relationships that can occur between any two relations in a relational data base. Relationships are first classified into primitive and composite relationships. Essentially a relationship between relations A and B is primitive if both A and B contain attributes drawn on a common domain. A composite relationship can be decomposed into a chain of primitively related relations. The most important primitive relationships are the simple one-to-many, co-relationships, and cyclic one-to-many. The most important composite relationships are the composite one-to-many, matrix, and cyclic matrix relationships.
Description
Keywords
Computer Science
Citation