Conference proceeding
Ternary relationship decomposition strategies based on binary imposition rules
Proceedings of the Eleventh International Conference on Data Engineering, pp 485-492
1995
Abstract
We review a set of rules identifying which combinations of ternary and binary relationships can be combined simultaneously in semantically related situations. We investigate the effect of these rules on decomposing ternary relationships to simpler, multiple binary relationships. We also discuss the relevance of these decomposition strategies to ER modeling. We show that if at least one 1:1 or 1:M binary constraint can be identified within the construct of the ternary itself, then any ternary relationship can be decomposed to a binary format. From this methodology we construct a heuristic-the Constrained Ternary Decomposition (CTD) rule.< >
Metrics
14 Record Views
Details
- Title
- Ternary relationship decomposition strategies based on binary imposition rules
- Creators
- Il-Yeol Song - Drexel UniversityT.H Jones - University of Maryland College of Information Studies
- Publication Details
- Proceedings of the Eleventh International Conference on Data Engineering, pp 485-492
- Publisher
- IEEE Comput. Soc. Press
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Information Science
- Web of Science ID
- WOS:A1995BC60N00058
- Other Identifier
- 991019203461604721
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Web of Science research areas
- Computer Science, Information Systems
- Computer Science, Theory & Methods