<?xml version="1.0"?>
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:title xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">Matrix representations of participation constraints</dc:title>
  <dc:contributor xmlns:dc="http://purl.org/dc/elements/1.1/">Hartmann, Sven , 1969- (VerfasserIn)</dc:contributor>
  <dc:contributor xmlns:dc="http://purl.org/dc/elements/1.1/">Leck, Uwe , 1969- (VerfasserIn)</dc:contributor>
  <dc:type xmlns:dc="http://purl.org/dc/elements/1.1/">Text</dc:type>
  <dc:type xmlns:dc="http://purl.org/dc/elements/1.1/">Text</dc:type>
  <dc:date xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">2003</dc:date>
  <dc:date xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">2003</dc:date>
  
  <dc:language xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">eng</dc:language>
  <dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">electronic resource</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">remote</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">Computermedien</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">Online-Ressource</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">1 Online-Ressource (11 Seiten)</dc:format>
  <dc:description xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">We discuss the existence of matrix representations for generalized 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.&lt;eng&gt;</dc:description>
  <dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">Open Access</dc:rights>
  <dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">Urheberrechtsschutz 1.0</dc:rights>
  <dc:description xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">Sven Hartmann,Uwe Leck</dc:description>
  <dc:subject xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">510</dc:subject>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">https://purl.uni-rostock.de/rosdok/id00005907</dc:identifier>
  <dc:relation xmlns:dc="http://purl.org/dc/elements/1.1/">Matrix representations of participation constraints--(DE-627)364260610</dc:relation>
  
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">urn:nbn:de:gbv:28-rosdok_id00005907-5</dc:identifier>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">doi: 10.18453/rosdok_id00005907</dc:identifier>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">oclc: 1622067219</dc:identifier>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">ppn:
				(DE-627)1987391675</dc:identifier>
</oai_dc:dc>
