Skip to main content
SpringerLink
Log in

On Matrix Representations of Participation Constraints

  • Conference paper
Book cover Advances in Conceptual Modeling - Challenging Perspectives (ER 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5833))

Included in the following conference series:

Abstract

We discuss the existence of matrix representations for generalised and minimum participation constraints which are frequently used in database design and conceptual modelling. Matrix representations, also known as Armstrong relations, have been studied in literature e.g. for functional dependencies and play an important role in example-based design and for the implication problem of database constraints. The major tool to achieve the results in this paper is a theorem of Hajnal and Szemerédi on the occurrence of clique graphs in a given graph.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Armstrong, W.W.: Dependency structures of database relationship. Inform. Process. 74, 580–583 (1974)

    MathSciNet  Google Scholar 

  2. Beeri, C., Dowd, M., Fagin, R., Statman, R.: On the structure of Armstrong relations for functional dependencies. J. ACM 31, 30–46 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bennett, F.E., Wu, L.: On minimum matrix representation of Sperner systems. Discrete Appl. Math. 81, 9–17 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bollobás, B.: Extremal graph theory. Academic Press, London (1978)

    MATH  Google Scholar 

  5. Chen, P.P.: The entity-relationship model: towards a unified view of data. ACM Trans. Database Systems 1, 9–36 (1976)

    Article  Google Scholar 

  6. Colbourn, C.J., Dinitz, J.H. (eds.): The CRC handbook of combinatorial designs. CRC Press, Boca Raton (1996)

    MATH  Google Scholar 

  7. Demetrovics, J.: On the equivalence of candidate keys and Sperner systems. Acta. Cybernet. 4, 247–252 (1979)

    MathSciNet  MATH  Google Scholar 

  8. Demetrovics, J., Gyepesi, G.: On the functional dependency and some generalizations of it. Acta. Cybernet. 5, 295–305 (1981)

    MathSciNet  MATH  Google Scholar 

  9. Demetrovics, J., Katona, G.O.H., Sali, A.: Design type problems motivated by database theory. J. Statist. Plann. Inference 72, 149–164 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  10. Erdős, P.: Extremal problems in graph theory. In: A seminar in graph theory, Holt, Rinehart and Winston (1967)

    Google Scholar 

  11. Hajnal, A., Szemerédi, E.: Proof of a conjecture of Erdős. In: Combinatorial theory and its applications. North-Holland, Amsterdam (1970)

    Google Scholar 

  12. Hartmann, S.: On the implication problem for cardinality constraints and functional dependencies. Ann. Math. Art. Intell. 33, 253–307 (2001)

    Article  MathSciNet  Google Scholar 

  13. Hartmann, S.: Reasoning about participation constraints and Chen’s constraints. In: ADC. CRPIT, vol. 17, pp. 105–113. ACS (2003)

    Google Scholar 

  14. Hartmann, S., Link, S.: Numerical keys for XML. In: Leivant, D., de Queiroz, R. (eds.) WoLLIC 2007. LNCS, vol. 4576, pp. 203–217. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Katona, G.O.H., Tichler, K.: Some contributions to the minimum representation problem of key systems. In: Dix, J., Hegner, S.J. (eds.) FoIKS 2006. LNCS, vol. 3861, pp. 240–257. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Lenzerini, M., Nobili, P.: On the satisfiability of dependency constraints in entity-relationship schemata. Inform. Systems 15, 453–461 (1990)

    Article  Google Scholar 

  17. Levene, M., Loizou, G.: A guided tour of relational databases and beyond. Springer, Heidelberg (1999)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  19. Lopes, S., Petit, J.-M., Lakhal, L.: Efficient discovery of functional dependencies and Armstrong relations. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 350–364. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  20. Mannila, H., Räihä, K.: Design by Example: An application of Armstrong relations. J. Comput. Syst. Sci., 126–141 (1986)

    Google Scholar 

  21. Mannila, H., Räihä, K.: The design of relational databases. Addison-Wesley, Reading (1992)

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  23. Thalheim, B.: Dependencies in relational databases. Teubner (1991)

    Google Scholar 

  24. Thalheim, B.: Fundamentals of cardinality constraints. In: Pernul, G., Tjoa, A.M. (eds.) ER 1992. LNCS, vol. 645, pp. 7–23. Springer, Heidelberg (1992)

    Google Scholar 

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

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Clausthal University of Technology, Germany

    Sven Hartmann

  2. Department of Mathematics and Computer Science, University of Wisconsin, USA

    Uwe Leck

  3. School of Information Management, Victoria University of Wellington, New Zealand

    Sebastian Link

Authors
  1. Sven Hartmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uwe Leck
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Instituto de Informática, Federal University of Rio Grande do Sul, Porto Alegre, Brazil

    Carlos Alberto Heuser

  2. Department of Management Information Systems, University of Regensburg, Universitätsstraße 31, 93053, Regensburg, Germany

    Günther Pernul

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hartmann, S., Leck, U., Link, S. (2009). On Matrix Representations of Participation Constraints. In: Heuser, C.A., Pernul, G. (eds) Advances in Conceptual Modeling - Challenging Perspectives. ER 2009. Lecture Notes in Computer Science, vol 5833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04947-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04947-7_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04946-0

  • Online ISBN: 978-3-642-04947-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation