Minimum matrix representation of some key system

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

Volumn 1762 LNCS, Issue , 2000, Pages 275-287

  Tichler, Krisztián ^a,b  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

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

Author keywords

Antikeys; Extremal problems; Keys; Labelled directed tree; Relational database

Indexed keywords

DECISION TREES; TREES (MATHEMATICS);

ANTIKEYS; DIRECTED TREES; EXTREMAL PROBLEMS; KEYS; RELATIONAL DATABASE;

MATRIX ALGEBRA;

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

References (8)

1. W.W. Armstrong, Dependency structures of database relationship, Information Processing 74 (North Holland, Amsterdam, 1974) 580-583.
2. F.E. Benett, Lisheng Wu, On minimum matrix representation of closure operations, Discrete Appl. Math. 26 (1990) 25-40.
3. J. Demetrovics, Candidate keys and antichains, SIAM J. Algebraic Methods 1 (1980) 92.
4. J. Demetrovics, On the equivalence of candidate keys with Sperner systems, Acta Cybernet. 4 (1979) 247-252.
5. J. Demetrovics, Z. Füredi, G.O.H. Katona, Minimum matrix representation of closure operations, Discrete Appl. Math. 11 (1985) 115-128.
6. J. Demetrovics, G.O.H. Katona, Extremal combinatorial problems in relational database, in Fundamentals of Computation Theory 81, Proc. of the 1981 International FCT-Conference, Szeged, Hungary, 1981, Lecture Notes in Computer Science 117 (Springer, Berlin 1981) 110-119.
7. Z. Füredi, Perfect error-correcting databases, Discrete Appl. Math. 28 (1990) 171-176.
8. G.O.H. Katona, Combinatorial and algebraic results for database relations, in J. Biskup, R. Hull, ed., Database Theory - ICDT '92, Berlin, 1992, Lecture Notes in Comput. Science, 646 (Springer Verlag, Berlin, 1992) 1-20.