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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
Armstrong, W.W.: Dependency structures of database relationship. In: Information processing, vol. 74, pp. 580–583. North Holland, Amsterdam (1974)
Csiszár, I., Körner, J.: Information theory. In: Coding theorems for discrete memoryless systems. Probability and Mathematical Statistics. Academic Press, Inc. (Harcourt Brace Jovanovich, Publishers), New York-London (1981)
Demetrovics, J.: On the equivalence of candidate keys with Sperner systems. Acta Cybernetica 4, 247–252 (1979)
Demetrovics, J., Füredi, Z., Katona, G.O.H.: Minimum matrix representation of closure operations. Discrete Appl. Math. 11(2), 115–128 (1985)
Demetrovics, J., Gyepesi, G.: On the functional dependency and some generalizations of it. Acta Cybernetica 5(3), 295–305 (1980/1981)
Demetrovics, J., Gyepesi, G.: A note on minimal matrix representation of closure operations. Combinatorica 3(2), 177–179 (1983)
Füredi, Z.: Perfect error-correcting databases. Discrete Appl. Math. 28, 171–176 (1990)
Tuo, L.S., Qi, Y.: A Chebychev’s type of prime number theorem in a short interval. II. Hardy-Ramanujan J. 15, 1–33 (1992/1993)
Van Lindt, W.: A Course in Combinatorics, ch. 22. Cambridge Univ. Press, Cambridge (1992)
Tichler, K.: Extremal theorems for databases. Annals of Mathematics and Artificial Intelligence 40, 165–182 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katona, G.O.H., Tichler, K. (2006). Some Contributions to the Minimum Representation Problem of Key Systems. In: Dix, J., Hegner, S.J. (eds) Foundations of Information and Knowledge Systems. FoIKS 2006. Lecture Notes in Computer Science, vol 3861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11663881_14
Download citation
DOI: https://doi.org/10.1007/11663881_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31782-1
Online ISBN: 978-3-540-31784-5
eBook Packages: Computer ScienceComputer Science (R0)