POLYGONAL JOIN DEPENDENCIES, CLOSED CO-RELATIONSHIP CHAINS AND THE CONNECTION TRAP IN RELATIONAL DATA BASES
| dc.contributor.author | Bradley, James | eng |
| dc.date.accessioned | 2008-02-27T22:58:47Z | |
| dc.date.available | 2008-02-27T22:58:47Z | |
| dc.date.computerscience | 1999-05-27 | eng |
| dc.date.issued | 1987-01-01 | eng |
| dc.description.abstract | Co-relationships between relations occur when both attributes supporting the relationship are non primary keys. A co-relationship can have at least three levels of semantic significance. A special case arises when relations are linked in a closed chain by co-relationships that have existential semantic significance. For binary relations in such a closed chain, it is shown that there is a fundamental theorem that prohibits extraction of reliable information from a complete join of the relations, unless the join contains a polygonal join dependency of order equal to the number of relations in the chain. Users who ignore this restriction fall into a sophisticated connection trap. | 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-256-04 | eng |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30456 | |
| dc.identifier.uri | http://hdl.handle.net/1880/46289 | |
| dc.language.iso | Eng | eng |
| dc.publisher.corporate | University of Calgary | eng |
| dc.publisher.faculty | Science | eng |
| dc.subject | Computer Science | eng |
| dc.title | POLYGONAL JOIN DEPENDENCIES, CLOSED CO-RELATIONSHIP CHAINS AND THE CONNECTION TRAP IN RELATIONAL DATA BASES | eng |
| dc.type | unknown | |
| thesis.degree.discipline | Computer Science | eng |