A FUNDAMENTAL CLASSIFICATION OF RELATIONSHIPS IN RELATIONAL DATABASES
| dc.contributor.author | Bradley, J. | eng |
| dc.date.accessioned | 2008-02-27T22:58:52Z | |
| dc.date.available | 2008-02-27T22:58:52Z | |
| dc.date.computerscience | 1999-05-27 | eng |
| dc.date.issued | 1987-05-01 | eng |
| dc.description.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. | eng |
| dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
| dc.identifier.department | 1987-265-13 | eng |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30408 | |
| dc.identifier.uri | http://hdl.handle.net/1880/46290 | |
| dc.language.iso | Eng | eng |
| dc.publisher.corporate | University of Calgary | eng |
| dc.publisher.faculty | Science | eng |
| dc.subject | Computer Science | eng |
| dc.title | A FUNDAMENTAL CLASSIFICATION OF RELATIONSHIPS IN RELATIONAL DATABASES | eng |
| dc.type | unknown | |
| thesis.degree.discipline | Computer Science | eng |