Abstract
In the relational data model, the problem of data redundancy has been successfully tackled via decomposition. In advanced data models, decomposition by pivoting provides a similar concept. Pivoting has been introduced by Biskup et al. [5], and used for decomposing relationship types according to a unary nonkey functional dependency. Our objective is to study pivoting in the presence of cardinality constraints which are commonly used in semantic data models. In order to ensure the equivalence of the given schema and its image under pivoting, the original application-dependent constraints have to be preserved. We discuss this problem for sets of participation and co- occurrence constraints. In particular, we prove the necessity of path cardinality constraints, and give an appropriate foundation for this concept.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
W.W. Armstrong, Dependency structures of database relationship, Information Processing 74 (1974) 580–583.
P. Assenova and P. Johannesson, Improving quality in conceptual modelling by the use of schema transformations, in: B. Thalheim (ed.), Conceptual Modeling (Springer, Berlin, 1996) 277–291.
C. Batini, S. Ceri and S.B. Navathe, Database design with the ER model, (Benjamin/Cummings, Menlo Park, 1991).
J. Biskup, R. Menzel and T. Polle, Transforming an entity-relationship schema into object-oriented database schemas, in: Proc. ADBIS’95 (Moscow, 1995) 67–78.
J. Biskup, R. Menzel, T. Polle and Y. Sagiv, Decomposition of relationships through pivoting, in: B. Thalheim (ed.), Conceptual Modeling (Springer, Berlin, 1996) 28–41.
J. Biskup and T. Polle, Decomposition of database classes under path functional dependencies and onto constraints, in: B. Thalheim and K.-D. Schewe (eds.), Foundations of Information and Knowledge systems (Springer, Berlin, 2000) 31–49.
D. Calvanese and M. Lenzerini, Making object-oriented schemas more expressive, Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, (ACM Press, Minneapolis, 1994) 243–254.
P.P. Chen, The Entity-Relationship Model: Towards a unified view of data, ACM Trans. Database Syst. 1 (1976) 9–36.
E.F. Codd, A relation model of data for large shared data banks, Commun. ACM 13 (1970) 377–387.
D.W. Embley, B.D. Kurtz and S.N. Woodfield, Object oriented systems analysis: a model-driven approach, (Yourdon Press Series, Prentice Hall, 1992).
J. Grant and J. Minker, Inferences for numerical dependencies, Theoretical Comput. Sci. 41 (1985) 271–287.
J. Gross and J. Yellen, Graph theory, (CRC press, Boca Raton, 1999).
S. Hartmann, über die Charakterisierung und Konstruktion von ER-Datenbanken mit KardinalitÄtsbedingungen, Ph.D. thesis (Rostock, 1996).
S. Hartmann, On the consistency of int-cardinality constraints, in: T.W. Ling, S. Ram and M.L. Lee (eds.), Conceptual Modeling, LNCS 1507 (Springer, Berlin, 1998) 150–163.
S. Hartmann, On interactions of cardinality constraints, key and functional dependencies, in: B. Thalheim and K.-D. Schewe (eds.), Foundations of Information and Knowledge systems (Springer, Berlin, 2000) 31–49.
S.W. Liddle, D.W. Embley and S.N. Woodfield, Cardinality constraints in semantic data models, Data Knowl. Eng. 11 (1993) 235–270.
M. Lenzerini and P. Nobili, On the satisfiability of dependency constraints in Entity-Relationship schemata, Information Systems 15 (1990) 453–461.
H. Mannila and K. RÄihÄ, The design of relational databases, (Addison-Wesley, Reading, 1992).
J.A. Makowsky and E.V. Ravve, Dependency preserving refinements and the fundamental problem of database design, Data Knowl. Eng. 24 (1998) 277–312.
A. McAllister, Complete rules for n-ary relationship cardinality constraints, Data Knowl. Eng. 27 (1998) 255–288.
B. Thalheim, Foundations of Entity-Relationship Modeling, Ann. Math. Artif. Intell. 6 (1992) 197–256.
B. Thalheim, Entity-relationship modeling (Springer, Berlin, 2000).
J.D. Ullman, Principles of database and knowledge-base systems, Vol. I (Computer Science Press, Rockville, 1988).
G.E. Weddell, Reasoning about functional dependencies generalized for semantic data models, ACM Trans. Database Syst. 17 (1992) 32–64.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hartmann, S. (2000). Decomposition by Pivoting and Path Cardinality Constraints. In: Laender, A.H.F., Liddle, S.W., Storey, V.C. (eds) Conceptual Modeling — ER 2000. ER 2000. Lecture Notes in Computer Science, vol 1920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45393-8_10
Download citation
DOI: https://doi.org/10.1007/3-540-45393-8_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41072-0
Online ISBN: 978-3-540-45393-2
eBook Packages: Springer Book Archive