Fundamentals of database systems (2nd ed.)
Fundamentals of database systems (2nd ed.)
A practical guide to logical data modeling
A practical guide to logical data modeling
Analysis of binary/ternary cardinality combinations in entity-relationship modeling
Data & Knowledge Engineering
An analysis of the structural validity of ternary relationships in entity relationship modeling
Proceedings of the seventh international conference on Information and knowledge management
Database modeling and design (3rd ed.)
Database modeling and design (3rd ed.)
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Case Method: Entity Relationship Modelling
Case Method: Entity Relationship Modelling
Data Analysis for Data Base Design
Data Analysis for Data Base Design
Software Engineering Economics
Software Engineering Economics
Database System Concepts
IEEE Transactions on Computers
Management of Software Development
IEEE Transactions on Software Engineering
Conceptual Data Modeling: An Algebraic Viewpoint
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
| Hi-index | 0.00 |
In this paper, we present the complete classification of recursive relationships and the criteria that contribute to the structural validity of modeling recursive relationships within the entity-relationship (ER) diagram. Unlike typical other analyses that use only maximum cardinality constraints, we have used both maximum and minimum cardinality constraints in defining the properties and their structural validity criteria. We used the notions of role uniqueness, path connectivity, and cardinality constraints to derive a complete and comprehensive set of decision rules. Five rules and three corollaries were established to determine structural validity of recursive relationships. The contribution of this paper is to present a complete taxonomy of recursive relationships with their properties as well as the decision rules for their structural validity. These decision rules can be readily applied to real world data models regardless of their complexity. The rules can easily be incorporated into the database modeling and designing process, or extended into case tool implementations.