Extremal theorems for databases

Annals of Mathematics and Artificial Intelligence

Volumn 40, Issue 1-2, 2004, Pages 165-182

  Tichler, Krisztián ^a  

^a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

Antikeys; Cliques; Extremal problems; Keys; Labelled directed tree; Maximal independent sets; Relational database model

Indexed keywords

EID: 0347126305     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026162114022     Document Type: Conference Paper

References (21)

1. S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases (Addison-Wesley, Reading, MA, 1995).
2. W.W. Armstrong, Dependency structures of database relationship, in: Information Processing 74 (North-Holland, Amsterdam, 1974) pp. 580-583.
3. F.E. Bennett and L.S. Wu, On minimum matrix representation of closure operations, Discrete Appl. Math. 26 (1990) 25-40.
4. F.E. Bennett and L.S. Wu, Minimum matrix representation of Sperner-systems, Discrete Appl. Math. 81(1-3) (1998) 9-17.
5. J. Demetrovics, On the equivalence of candidate keys with Sperner systems, Acta Cybernet. 4 (1979) 247-252.
6. J. Demetrovics, Candidate keys and antichains, SIAM J. Algebraic Methods 1 (1980) 92.
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 G.O.H. Katona, Extremal combinatorial problems in relational database, in: Fundamentals of Computation Theory 81, Proc. of the 1981 Internat. FCT Conference, Szeged, Hungary, Lecture Notes in Computer Science, Vol. 117 (Springer, Berlin, 1981) pp. 110-119.
9. Z. Füredi, The number of maximal independent sets in connected graphs, J. Graph Theory 11 (1987) 463-470.
10. Z. Füredi, Perfect error-correcting databases, Discrete Appl. Math. 28 (1990) 171-176.
11. B. Ganter and H.-D.O.F. Gronau, Two conjectures of Demetrovics, Füredi and Katona, concerning partitions, Combinatorics of ordered sets (Oberwolfach, 1988), Discrete Math. 88(2/3) (1991) 149-155.
12. J.R. Griggs, C.M. Grinstead and D.R. Guichard, The maximum number of maximal independent sets in a connected graph, Discrete Math. 68(2/3) (1988) 211-220.
13. M. Hujter and Z. Tuza, The number of maximal independent sets in triangle-free graphs, SIAM J. Discrete Math. 6(2) (1993) 284-288.
14. G.O.H. Katona, Combinatorial and algebraic results for database relations, in: Database Theory - ICDT'92, eds. J. Biskup and R. Hull, Berlin, Lecture Notes in Computer Science, Vol. 646 (Springer, Berlin, 1992) pp. 1-20.
15. J. Liu, Maximal independent sets in bipartite graphs, J. Graph Theory 17(4) (1993) 495-507.
16. H. Mannila and K. Räihä, The Design of Relational Databases (Addison-Wesley, Reading, MA, 1992).
17. R.E. Miller and D.E. Muller, A problem of maximum consistent subsets, IBM Research Report RC-240, J.T. Watson Research Center, Yorktown Heights, NY (1960).
18. J.W. Moon and L. Moser, On cliques in graphs, Israel J. Math. 3 (1965) 23-28.
19. B.E. Sagan, A note on independent sets in trees, SIAM J. Discrete Math. 1 (1988) 105-108.
20. K. Tichler, Minimum matrix representation of some key systems, Discrete Appl. Math. 117(1-3) (2002) 267-277.
21. H.S. Wilf, The number of maximal independent sets in a tree, SIAM J. Algebraic Discrete Methods 7 (1986) 125-130.