On Matrix Representations of Participation Constraints

  • Authors:
  • Sven Hartmann;Uwe Leck;Sebastian Link

  • Affiliations:
  • Department of Informatics, Clausthal University of Technology, Germany;Department of Mathematics and Computer Science, University of Wisconsin, USA;School of Information Management, Victoria University of Wellington, New Zealand

  • Venue:
  • ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.