{'fraction_non_alphanumeric': 0.021629416005767843, 'fraction_numerical': 0.0021629416005767843, 'mean_word_length': 5.673076923076923, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Reasoning about participation constraints and Chen's constraints

Cardinality constraints are often considered as one of the basic constituents of the entity-relationship approach to database design. In his original proposal of this model, Chen [6] defined cardinality constraints as look-across constraints. Alternatively, however, cardinality constraints may also be defined on the basis of the participation or look-here interpretation.While both definitions correspond to each other for binary relationships, they differ for n-ary relationships (with n ≥ 3). Participation constraints restrict the number of relationships a fixed object may participate in. Chen-style constraints limit the number of objects that co-occur with a given tuple comprising instances of the remaining n - 1 components of the relationship type under discussion.In our paper we present a sound and complete system of inference rules for a class of generalized cardinality constraints containing both, participation constraints and Chen-style constraints. It turns out that both constraint classes are almost independent, which justifies their juxtaposition in conceptual database design. Similar results will be presented in the presence of additional functional dependencies. The paper concludes with an axiomatization for the joint class of generalized cardinality constraints and functional dependencies.