Understanding the concept of "completeness" in frameworks for modeling cardinality constraints

Faiz Currim, Sudha Ram

Research output: Contribution to conferencePaperpeer-review

5 Scopus citations

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 languageEnglish (US)
Pages31-36
Number of pages6
DOIs
StatePublished - 2006
Event16th Workshop on Information Technologies and Systems, WITS 2006 - Milwaukee, WI, United States
Duration: Dec 9 2006Dec 10 2006

Other

Other16th Workshop on Information Technologies and Systems, WITS 2006
Country/TerritoryUnited States
CityMilwaukee, WI
Period12/9/0612/10/06

ASJC Scopus subject areas

  • Information Systems
  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'Understanding the concept of "completeness" in frameworks for modeling cardinality constraints'. Together they form a unique fingerprint.

Cite this