Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/46283
Title: A FUNDAMENTAL CLASSIFICATION OF ASSOCIATIONS IN RELATIONAL DATABASES
Authors: Bradley, J.
Keywords: Computer Science
Issue Date: 1-Jun-1985
Abstract: A fundamental classification is proposed for the associations that can occur beteween any two relations in a relational data base. Associations are first classified into primitive and composite associations. Essentially an association between relations A and B is primitive if both A and B contain attributes drawn on a common domain. A composite association can be decomposed into a chain of primitive associations. The most important primitive associations are the functional, multivalued and equivalence associations. The most important composite associations are the cascade, matrix, and cascade equivalence associations. Most primitive and composite associations have cyclic versions.
URI: http://hdl.handle.net/1880/46283
Appears in Collections:Bradley, James

Files in This Item:
File Description SizeFormat 
1985-204-17.pdf2.73 MBAdobe PDFView/Open


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