On the implication problem for cardinality constraints and functional dependencies

Annals of Mathematics and Artificial Intelligence

Volumn 33, Issue 2-4, 2001, Pages 253-307

  Hartmann, Sven ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

Armstrong database; Cardinality constraint; Clique graph; Functional dependency; Implication problem; Key; Transversal design

Indexed keywords

EID: 0035565195     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013133428451     Document Type: Article

References (52)

1. B. Alspach, K. Heinrich and G. Liu, Orthogonal factorizations of graphs, in: Contemporary Design Theory, eds. Dinitz and Stinson (Wiley, New York, 1992) chapter 2.
2. W.W. Armstrong, Dependency structures of database relationship, Inform. Process. 74 (1974) 580-583.
3. P. Atzeni and V. De Antonelles, Relational Database Theory (Benjamin/Cummings, Redwood, 1993).
4. C. Batini, S. Ceri and S. Navathe, eds., Conceptual Database Design (Benjamin/Cummings, Redwood, 1992).
5. C. Beeri and B. Thalheim, Identification as a primitive of database models, in: Fundamentals of Information Systems, eds. T. Polle et al. (Kluwer, Dordrecht, 1999) pp. 19-36.
6. F.E. Bennett and L. Wu, On minimum matrix representation of closure operations, Discrete Appl. Math. 26 (1990) 25-40.
7. F.E. Bennett and L. Wu, On minimum matrix representation of Sperner systems, Discrete Appl. Math. 81 (1998) 9-17.
8. T. Beth, D. Jungnickel and H. Lenz, Design Theory (BI, Mannheim, 1985).
9. A. Binemann-Zdanowicz, Systematization of approaches to equality-generating constraints, in: Current Issues in Databases and Information Systems, eds. J. Stuller et al., Lecture Notes in Computer Science, Vol. 1884 (Springer, Berlin, 2000) pp. 307-314.
10. J. Biskup, R. Menzel, T. Polle and Y. Sagiv, Decomposition of relationships through pivoting, in: Conceptual Modeling, ed. B. Thalheim, Lecture Notes in Computer Science, Vol. 823 (Springer, Berlin, 1996) pp. 28-41.
11. B. Bollobás, Extremal Graph Theory (Academic Press, London, 1978).
12. G. Burosch, J. Demetrovics and G.O.H. Katona, The poset of closures as a model of changing databases, Order 4 (1987) 127-142.
13. D. Calvanese and M. Lenzerini, On the interaction between ISA and cardinality constraints, in: Proc. of Tenth Int. Conf. on Data Engin. (1994) pp. 204-213.
14. P.P. Chen, The entity-relationship model: towards a unified view of data, ACM Trans. Database Systems 1 (1976) 9-36.
15. S. Chowla, P. Erdos and E.G. Straus, On the maximal number of pairwise orthogonal Latin squares of a given order, Canad. J. Math. 12 (1960) 204-208.
16. E.F. Codd, A relation model of data for large shared data banks, Comm. ACM 13 (1970) 377-387.
17. C.J. Colbourn and J.H. Dinitz, eds., The CRC Handbook of Combinatorial Designs (CRC Press, Boca Raton, 1996).
18. C. Delobel and R.G. Casey, Decompositions of a database and the theory of Boolean switching functions, IBM J. Res. Develop. 17 (1973) 374-386.
19. J. Demetrovics, On the equivalence of candidate keys and Sperner systems, Acta Cybernet. 4 (1979) 247-252.
20. J. Demetrovics, Z. Füredi and G.O.H. Katona, Minimum matrix representation of closure operations, Discrete Appl. Math. 11 (1985) 115-128.
21. J. Demetrovics and G.O.H. Katona, A survey on some combinatorial problems concerning functional dependencies in database relations, Ann. Math. Artificial Intelligence 7 (1993) 63-82.
22. J. Demetrovics, G.O.H. Katona and A. Sali, Design type problems motivated by database theory, J. Statist. Plann. Inference 72 (1998) 149-164.
23. J. Demetrovics and V.D. Thi, Relations and minimal keys, Acta Cybernet. 8 (1988) 279-285.
24. J. Demetrovics and V.D. Thi, Some results about functional dependencies, Acta Cybernet. 8 (1988) 273-278.
25. J.H. Dinitz and D.R. Stinson, eds., Contemporary Design Theory (Wiley, New York, 1992).
26. P. Erdos, Extremal problems in graph theory, in: A Seminar in Graph Theory, ed. F. Harary (Holt, Rinehart and Winston, 1967) pp. 54-64.
27. P.P. Chen et al., eds., Conceptual Modeling, Lecture Notes in Computer Science, Vol. 1565 (Springer, Berlin, 1996).
28. B. Ganter and H.-D.O.F. Gronau, On two conjectures of Demetrovics, Füredi and Katona on partitions, Discrete Math. 88 (1991) 149-155.
29. M. Gondran and M. Minoux, Graphs and Algorithms (Wiley, Chichecter, 1990).
30. H.-D.O.F. Gronau, M. Grüttmüller, S. Hartmann, U. Leck and V. Leck, On orthogonal double covers of graphs, Des. Codes Cryptogr. (2001) to appear.
31. H.-D.O.F. Gronau, R.C. Mullin and A. Rosa, Orthogonal double covers of complete graphs by trees, Graphs Combin. 13 (1997) 251-262.
32. H.-D.O.F. Gronau, R.C. Mullin and P.J. Schellenberg, On orthogonal double covers and a conjecture of Chung and West, J. Combin. Designs 3 (1995) 213-231.
33. A. Hajnal and E. Szemerédi, Proof of a conjecture of Erdos, in: Combinatorial Theory and its Applications, eds. A. Renyi, P. Erdos and V.T. Sós, Colloq. Math. Soc. János Bolyai, Vol. 4 (North-Holland, Amsterdam, 1970) pp. 601-623.
34. S. Hartmann, Graphtheoretic methods to construct entity-relationship databases, in: Graphtheoretic Concepts in Computer Science, ed. M. Nagl, Lecture Notes in Computer Science, Vol. 1017 (Springer, Berlin, 1995) pp. 131-145.
35. S. Hartmann, On the consistency of int-cardinality constraints, in: Conceptual Modeling, eds. T.W. Ling, S. Ram and M.L. Li, Lecture Notes in Computer Science, Vol. 1507 (Springer, Berlin, 1998) pp. 150-163.
36. S. Hartmann, Orthogonal decompositions of complete digraphs, Graphs Combin. (1998) to appear.
37. D. Jungnickel, Graphen, Netzwerke und Algorithmen (BI, Mannheim, 1994).
38. M. Lenzerini and P. Nobili, On the satisfiability of dependency constraints in entity-relationship schemata, Inform. Syst. 15 (1990) 453-461.
39. S.W. Liddle, D.W. Embley and S.N. Woodfield, Cardinality constraints in semantic data models, Data Knowledge Engrg. 11 (1993) 235-270.
40. H.F. MacNeish, Euler's squares, Ann. of Math. 23 (1922) 221-227.
41. H. Mannila and K. Räihä, Design by example: an application of Armstrong relations, J. Comput. Syst. Sci. 33 (1986) 126-141.
42. H. Mannila and K. Räihä, The Design of Relational Databases (Addison-Wesley, Reading, 1992).
43. A. McAllister, Complete rules for n-ary relationship cardinality constraints, Data Knowledge Engrg. 27 (1998) 255-288.
44. H. Noltemeier, Graphentheorie (de Gruyter, Berlin, 1976).
45. A. Schrijver, Theory of Linear and Integer Programming (Wiley, Chichecter, 1986).
46. T. Takaoka, Subcubic cost algorithms for the all pairs shortest path problem, Algorithmica 20 (1998) 309-318.
47. B. Thalheim, Dependencies in Relational Databases (Teubner, Stuttgart, 1991).
48. B. Thalheim, Foundations of entity-relationship modeling, Ann. Math. Artificial Intelligence 6 (1992) 197-256.
49. B. Thalheim, Fundamentals of cardinality constraints, in: Entity-Relationship Approach, eds. G. Pernul and A.M. Tjoa, Lecture Notes in Computer Science, Vol. 645 (Springer, Berlin, 1992) pp. 7-23.
50. B. Thalheim, Entity-Relationship Modeling (Springer, Berlin, 2000).
51. D. Theodorates, Deductive object oriented schemas, in: Conceptual Modeling, ed. B. Thalheim, Lecture Notes in Computer Science, Vol. 1157 (Springer, Berlin, 1996) pp. 58-72.
52. K. Tichler, Minimum matrix representation of some key system, in: Foundations of Information and Knowledge Systems, eds. K.-D. Schewe and B. Thalheim, Lecture Notes in Computer Science, Vol. 1762 (Springer, Berlin, 2000) pp. 275-287.