Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/46290
Title: A FUNDAMENTAL CLASSIFICATION OF RELATIONSHIPS IN RELATIONAL DATABASES
Authors: Bradley, J.
Keywords: Computer Science
Issue Date: 1-May-1987
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.
URI: http://hdl.handle.net/1880/46290
Appears in Collections:Bradley, James

Files in This Item:
File Description SizeFormat 
1987-265-13.pdf2.5 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.