Welcome to D
SIGMOD 2004
PODS 2004
SIGMOD RECOR
CIKM 2004
DASFAA 2004
DBPL 2003
DE-BULLETIN
DEBS 2004
DMKD 2004
DMSN 2004
DOLAP 2004
DPDJ 2004
EDBT 2004
ER 2003
<<< = ER'03 Papers>>>
GIS 2004
HDP 2004
HYPERTEXT 20
ICDE 2004
ICDT 2003
JCDL 2004
MDM
MIR 2004
MIS 2004
MMDB 2004
MOBIDE 2003
RIDE 2004
SBBD 2003
SIGIR FORUM
SIGIR 2004
SIGKDD EXPLO
SIGKDD 2004
SSDBM 2004
SSTD 2003
TIME 2004
TODS 2004
VLDB 2004
VLDB Journal
WEBDB 2004
WIDM 2004
XIME-P 2004
Footer

Conceptual Treatment of Multivalued Dependencies


Bernhard Thalheim

  View Paper (PDF)  

Return to Conceptual Modeling Foundations


Abstract

Multivalued dependencies are considered to be difficult to teach, to handle and to model. This observation is true if multivalued dependencies are treated in the classical approach. We introduce another treatment of multivalued dependencies based on ER modeling techniques and show that multivalued dependenices can be handled in a more natural and intuitive way within our framework. Based on the concept of competing multivalued dependencies we can prove in which case a unique ER schema representation exists. If multivalued dependencies are competing then either one of the competing schemata is chosen or an approximation which combines the competing schemata can be used.


©2005 Association for Computing Machinery