On Interactions of Cardinality Constraints, Key, and Functional Dependencies
Cardinality constraints as well as key dependencies and functional dependencies are among the most popular classes of constraints in database models. While the formal properties of each of the constraint classes are now well understood, little is known about their interaction. The objective of this paper is to discuss how constraints from these classes go together. We propose methods for reasoning about a set of cardinality constraints, key and certain functional dependencies. Moreover, we construct Armstrong databases for these constraints, which are of special interest for example-based deduction in database design.
KeywordsFunctional Dependency Integrity Constraint Relationship Type Component Type Database Schema
Unable to display preview. Download preview PDF.
- 9.A. Hajnal and E. Szemeredi, Proof of a conjecture of Erdős, in: P. Erdős, A. Renyi and V.T. Sos (eds.), Combinatorial theory and its applications, Colloq. Math. Soc. Jáanos Bolyai 4 (North-Holland, Amsterdam, 1970) 601–623.Google Scholar
- 10.S. Hartmann, Graph-theoretic methods to construct entity-relationship databases, in: M. Nagl (ed.), Graph-theoretic concepts in computer science, LNCS 1017 (Springer, Berlin, 1995) 131–145.Google Scholar
- 11.S. Hartmann, On the consistency of int-cardinality constraints, in: T.W. Ling, S. Ram and M.L. Lee (eds.), Conceptual Modeling, LNCS 1507 (Springer, Berlin, 1998) 150–163.Google Scholar
- 20.B. Thalheim, Fundamentals of cardinality constraints, in: G. Pernul and A.M. Tjoa (eds.), Entity-relationship approach, LNCS 645 (Springer, Berlin, 1992) 7–23.Google Scholar