Decomposition of relationships through pivoting

Joachim Biskup, Ralf Menzel, Torsten Polle, Yehoshua Sagiv

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

19 Scopus citations

Abstract

In the literature there are several proposals to map entityrelationship schemas onto object-oriented schemas, but they only treat relationship sets nai'vely or restrict them to binary relationship sets. We follow a different approach in the treatment of relationship sets. Our goal is to let the designer specify relationships of any arity and then to employ semantic constraints to decompose relationships into smaller fragments. The semantic constraints in use are functional constraints, which are defined in the object-oriented framework. The decomposition process guided by functional constraints is similar to the decomposition process in the relational approach with functional dependencies, but it takes advantage of the features provided by the object-oriented data model. In object-oriented schemas it is possible to enforce a certain kind of functional constraints automatically, namely unary functional constraints.

Original languageEnglish
Title of host publicationConceptual Modeling, ER 1996 - 15th International Conference on Conceptual Modeling, Proceedings
PublisherSpringer Verlag
Pages28-41
Number of pages14
ISBN (Print)9783540617846
DOIs
StatePublished - 1996
Event15th International Conference on Conceptual Modeling, ER 1996 - Cottbus, Germany
Duration: 7 Oct 199610 Oct 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1157 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th International Conference on Conceptual Modeling, ER 1996
Country/TerritoryGermany
CityCottbus
Period7/10/9610/10/96

Fingerprint

Dive into the research topics of 'Decomposition of relationships through pivoting'. Together they form a unique fingerprint.

Cite this