Paper Info
Title
Some contributions to the minimum representation problem of key systems
Abstract
Some new and improved results on the minimum representation problem for key systems will be presented. By improving a lemma of the second author we obtain better or new results on badly representable key systems, such as showing the most badly representable key system known, namely of size 2n(1−c·loglogn / logn) where n is the number of attributes. We also make an observation on a theorem of J. Demetrovics, Z. Füredi and the first author and give some new well representable key systems as well.
Year
DOI
Venue
2006
10.1007/11663881_14
FoIKS
Keywords
Field
DocType
j. demetrovics,representable key system,minimum representation problem,improved result,new result,key system,z. f,relational database
Information system,Relational database,Computer science,Theoretical computer science,Artificial intelligence,Knowledge engineering,Lemma (mathematics)
Conference
Volume
ISSN
ISBN
3861
0302-9743
3-540-31782-1
Citations 
PageRank 
References 
8
0.41
6
Authors
2
Name
Order
Citations
PageRank
Gyula O. H. Katona126466.44
Krisztián Tichler2182.45