Abstract
Cardinality constraints have been a useful and integral part of conceptual database design since the original entity-relationship (ER) model proposed by Chen. Subsequently many papers discussing classification frameworks for cardinality constraints have been proposed. Completeness of such frameworks has always been in question since well-defined criteria do not exist to evaluate them. We propose a "reverse engineering" approach, i.e., one of defining conceptual modeling constraint completeness based on mappings from the relational model. We develop a correspondence for combinations of relational algebra operators to existing semantic constraint types. In doing so, we also come up with a new category of cardinality constraints not previously examined in literature. We feel our work has useful implications from a semantics perspective, and more importantly from a practical standpoint in developing automated mechanisms for implementing cardinality constraints.
Original language | English (US) |
---|---|
Pages | 31-36 |
Number of pages | 6 |
DOIs | |
State | Published - 2006 |
Event | 16th Workshop on Information Technologies and Systems, WITS 2006 - Milwaukee, WI, United States Duration: Dec 9 2006 → Dec 10 2006 |
Other
Other | 16th Workshop on Information Technologies and Systems, WITS 2006 |
---|---|
Country/Territory | United States |
City | Milwaukee, WI |
Period | 12/9/06 → 12/10/06 |
ASJC Scopus subject areas
- Information Systems
- Control and Systems Engineering