Conceptual database design: an Entity-relationship approach
Conceptual database design: an Entity-relationship approach
Designing quality databases with IDEF1X information models
Designing quality databases with IDEF1X information models
Analysis of binary/ternary cardinality combinations in entity-relationship modeling
Data & Knowledge Engineering
A first course in database systems
A first course in database systems
An approach for decomposing N-ary data relationships
Software—Practice & Experience
Database modeling and design (3rd ed.)
Database modeling and design (3rd ed.)
The Unified Modeling Language reference manual
The Unified Modeling Language reference manual
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
Journal of Database Management
A Guided Tour of Relational Databases and Beyond
A Guided Tour of Relational Databases and Beyond
Fundamentals of Database Systems
Fundamentals of Database Systems
Reasoning about participation constraints and Chen's constraints
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Dealing with relationship cardinality constraints in relational database design
Effective databases for text & document management
Entity-Relationship modeling revisited
ACM SIGMOD Record
Semantic Decision Tables: Self-organizing and Reorganizable Decision Tables
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Information and Software Technology
Relationship design using spreadsheet reasoning for sets of functional dependencies
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Guidelines for representing complex cardinality constraints in binary and ternary relationships
Software and Systems Modeling (SoSyM)
| Hi-index | 0.00 |
The transformation from n-ary relationships to a relational database schema has never been really fully analyzed. This paper presents one of the several ternary cases ignored by the ER-to-RM literature. The case shows that the following common belief is wrong: Given a set of FDs over a table resulting in a non-3NF situation, it is always possible to obtain a fully equivalent set of 3NF tables, without adding other restrictions than candidate keys and elementary inclusion dependencies.