Skip to main content
SpringerLink
Log in

Decomposition by Pivoting and Path Cardinality Constraints

  • Conference paper
  • First Online:
Conceptual Modeling — ER 2000 (ER 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1920))

Included in the following conference series:

  • 687 Accesses

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 to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W.W. Armstrong, Dependency structures of database relationship, Information Processing 74 (1974) 580–583.

    MathSciNet  Google Scholar 

  2. 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.

    Chapter  Google Scholar 

  3. C. Batini, S. Ceri and S.B. Navathe, Database design with the ER model, (Benjamin/Cummings, Menlo Park, 1991).

    Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

    Chapter  Google Scholar 

  6. 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.

    Chapter  Google Scholar 

  7. 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.

    Google Scholar 

  8. P.P. Chen, The Entity-Relationship Model: Towards a unified view of data, ACM Trans. Database Syst. 1 (1976) 9–36.

    Article  Google Scholar 

  9. E.F. Codd, A relation model of data for large shared data banks, Commun. ACM 13 (1970) 377–387.

    Article  MATH  Google Scholar 

  10. D.W. Embley, B.D. Kurtz and S.N. Woodfield, Object oriented systems analysis: a model-driven approach, (Yourdon Press Series, Prentice Hall, 1992).

    Google Scholar 

  11. J. Grant and J. Minker, Inferences for numerical dependencies, Theoretical Comput. Sci. 41 (1985) 271–287.

    Article  MATH  MathSciNet  Google Scholar 

  12. J. Gross and J. Yellen, Graph theory, (CRC press, Boca Raton, 1999).

    MATH  Google Scholar 

  13. S. Hartmann, über die Charakterisierung und Konstruktion von ER-Datenbanken mit KardinalitÄtsbedingungen, Ph.D. thesis (Rostock, 1996).

    Google Scholar 

  14. 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.

    Google Scholar 

  15. 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.

    Google Scholar 

  16. S.W. Liddle, D.W. Embley and S.N. Woodfield, Cardinality constraints in semantic data models, Data Knowl. Eng. 11 (1993) 235–270.

    Article  MATH  Google Scholar 

  17. M. Lenzerini and P. Nobili, On the satisfiability of dependency constraints in Entity-Relationship schemata, Information Systems 15 (1990) 453–461.

    Article  Google Scholar 

  18. H. Mannila and K. RÄihÄ, The design of relational databases, (Addison-Wesley, Reading, 1992).

    MATH  Google Scholar 

  19. J.A. Makowsky and E.V. Ravve, Dependency preserving refinements and the fundamental problem of database design, Data Knowl. Eng. 24 (1998) 277–312.

    Article  MATH  Google Scholar 

  20. A. McAllister, Complete rules for n-ary relationship cardinality constraints, Data Knowl. Eng. 27 (1998) 255–288.

    Article  MATH  Google Scholar 

  21. B. Thalheim, Foundations of Entity-Relationship Modeling, Ann. Math. Artif. Intell. 6 (1992) 197–256.

    MathSciNet  Google Scholar 

  22. B. Thalheim, Entity-relationship modeling (Springer, Berlin, 2000).

    MATH  Google Scholar 

  23. J.D. Ullman, Principles of database and knowledge-base systems, Vol. I (Computer Science Press, Rockville, 1988).

    Google Scholar 

  24. G.E. Weddell, Reasoning about functional dependencies generalized for semantic data models, ACM Trans. Database Syst. 17 (1992) 32–64.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Mathematik, UniversitÄt Rostock, 18051, Rostock, Germany

    Sven Hartmann

Authors
  1. Sven Hartmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Ciência da Computação, Universidade Federal de Minas Gerais, 31270-010, Belo Horizonte - MG, Brasil

    Alberto H. F. Laender

  2. Marriott School School of Accountancy and Information Systems, Brigham Young University, 585 TNRB, P.O. Box 23087, UT 84602-3087, Provo, USA

    Stephen W. Liddle

  3. Department of Computer Information Systems, Georgia State University, College of Business Administration, 30302-4015, Atlanta, Georgia, USA

    Veda C. Storey

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation