Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barker, R. CASE*METHOD®: Entity Relationship Modeling. Addison-Wesley, New York 1990.
Boehm, Barry W., Software Engineering, IEEE Transactions on Computers, 25(12)1226–1241, December 1976.
Boehm, Barry W., Software Engineering Economics, Prentice-Hall, Inc. Englewood Cliffs, NJ, 1981.
Chen, Peter, “The Entity-Relationship Model — Toward a Unified View of Data,” ACM Transactions on Database Systems, 1(1)9–36, March 1976.
Daly, E. B., Management of Software Engineering, IEEE Transactions on Software Engineering, 3(3)229–242, May, 1977
Dullea, James and Il-Yeol Song, “An Analysis of Structural Validity in Recursive and Binary Relationships in Entity Relationship Modeling”, The Proceedings of the Fourth International Conference on Computer Science and Informatics, Volume 3, pp 329–334, Research Triangle Park, NC, October 23-28, 1998.
Dullea, James and Il-Yeol Song, “An Analysis of Structural Validity of Ternary Relationships in Entity-Relationship Modeling,” Proceedings of Seventh International Conference on Information and Knowledge Management (CIKM’ 98), Nov. 3–7, 1998, Washington, D.C., pp. 331–339.
Elmasri, Ramez and Shamkant B. Navathe. Fundamentals of Database Systems, 2nd Ed., The Benjamin/Cummings Publishing Co, Inc., Redwood City, CA, 1994.
Fagan, M. Design and Code Inspections and Process Control in the Development of Programs, IBM Report IBM-SDD-TR-21-572, December 1974.
Howe, D. R., Data Analysis for Data Base Design, 2nd Ed., Edward Arnold, London, GB, 1989.
Trevor H. Jones and Il-Yeol Song, “Analysis of Binary/ternary Cardinality Combinations in Entity-Relationship Modeling,” Data & Knowledge Engineering, Vol 19, No. 1 (1996), pp. 39–64.
Korth, Henry F., and Abraham Silberschatz, 1997. Database System Concepts, 3rd Ed., McGraw-Hill, Inc., New York.
Song, Il-Yeol, Mary Evans, and E. K. Park, “A Comparative Analysis of Entity-Relationship Diagrams,” Journal of Computer & Software Engineering, 3(4)427–459, 1995.
Teorey, Toby J., Database Modeling and Design — The Entity-Relationship Approach, 3rd ed., Morgan Kaufmann Publishers, Inc., San Mateo, CA, 1998.
Tillman, George, A Practical Guide to Logical Data Modeling, McGraw-Hill, Inc., New York, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dullea, J., Song, IY. (1999). A Taxonomy of Recursive Relationships and Their Structural Validity in ER Modeling. In: Akoka, J., Bouzeghoub, M., Comyn-Wattiau, I., Métais, E. (eds) Conceptual Modeling — ER ’99. ER 1999. Lecture Notes in Computer Science, vol 1728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47866-3_26
Download citation
DOI: https://doi.org/10.1007/3-540-47866-3_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66686-8
Online ISBN: 978-3-540-47866-9
eBook Packages: Springer Book Archive