On interactions of cardinality constraints, key, and functional dependencies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1762 LNCS, Issue , 2000, Pages 136-155

  Hartmann, Sven ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ARMSTRONG DATABASE; CARDINALITY CONSTRAINTS; CONSTRAINT CLASS; DATABASE DESIGN; DATABASE MODELS; EXAMPLE BASED; FORMAL PROPERTIES; FUNCTIONAL DEPENDENCY;

DATABASE SYSTEMS;

EID: 77956762250     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46564-2_9     Document Type: Conference Paper

References (23)

1. W.W. Armstrong, Dependency structures of database relationship, Information Processing 74 (1974) 580-583.
2. C. Beeri, M. Dowd, R. Fagin and R. Statman, On the structure of Armstrong relations for functional dependencies, J. ACM 31 (1984) 30-46.
3. J. Biskup, R. Menzel, T. Polle and Y. Sagiv, Decomposition of relationships through pivoting, in: B. Thalheim (ed.), Conceptual Modeling (Springer, Berlin, 1996) 28-41.
4. P.P. Chen, The Entity-Relationship Model: Towards a unified view of data, ACM Trans. Database Syst. 1 (1984) 9-36.
5. E.F. Codd, A relation model of data for large shared data banks, Commun. ACM 13 (1970) 377-387.
6. C. Delobel and R.G. Casey, Decompositions of a database and the theory of Boolean switching functions, IBM J. Res. Dev. 17 (1973) 374-386.
7. J. Demetrovics, Z. Füredi and G.O.H. Katona, Minimum matrix representation of closure operations, Discrete Appl. Math. 11 (1985) 115-128.
8. J. Demetrovics and V.D. Thi, Some results about functional dependencies, Acta Cybern. 8 (1988) 273-278.
9. A. Hajnal and E. Szemeredi, Proof of a conjecture of Erdos, in: P. Erdos, A. Renyi and V.T. Sos (eds.), Combinatorial theory and its applications, Colloq. Math. Soc. János Bolyai 4 (North-Holland, Amsterdam, 1970) 601-623.
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.
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.
12. D. Jungnickel, T. Beth and H. Lenz, Design Theory (BI, Mannheim, 1985).
13. M. Lenzerini and P. Nobili, On the satisfiability of dependency constraints in Entity-Relationship schemata, Inf. Syst. 15 (1990) 453-461.
14. S.W. Liddle, D.W. Embley and S.N. Woodfield, Cardinality constraints in semantic data models, Data Knowl. Eng. 11 (1993) 235-270.
15. D. Maier, The theory of relational databases (Computer Science Press, Rockville, 1983).
16. H. Mannila and K. Räihä, Design by example: an application of Armstrong relations, J. Comput. Syst. Sci. 33 (1986) 126-141.
17. J. Paredaens, P. De Bra, M. Gyssens and D. Van Gucht, The structure of the relational database model (Springer, Berlin, 1989).
18. B. Thalheim, Dependencies in Relational Databases (Teubner, Stuttgart, 1991).
19. B. Thalheim, Foundations of Entity-Relationship Modeling, Ann. Math. Artif. Intell. 6 (1992) 197-256.
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.
21. D. Theodorates, Deductive object oriented schemas, in: B. Thalheim (ed.), Conceptual modeling, LNCS 1157 (Springer, Berlin, 1996) 58-72.
22. G.E. Weddell, Reasoning about functional dependencies generalized for semantic data models, ACM Trans. Database Syst. 17 (1992) 32-64.
23. J. Wijsen, J. Vandenbulcke and H. Olivie, Functional dependencies generalized for temporal databases, in: R. Elmasri, V. Kouramajian and B. Thalheim (eds.), Entity-Relationship approach, LNCS 823 (Springer, Berlin, 1994) 99-109.