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. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Hartmann, S., Leck, U., & Link, S. (2009). On matrix representations of participation constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5833 LNCS, pp. 75–84). https://doi.org/10.1007/978-3-642-04947-7_10
Mendeley helps you to discover research relevant for your work.