Abstract
We will investigate the following question: what can be the maximum number of independent functional dependencies in a database of n attributes, that is the maximum cardinality of a system of dependencies which which do not follow from the Armstrong axioms and none of them can be derived from the remaining ones using the Armstrong axioms. An easy and for long time believed to be the best construction is the following: take the maximum possible number of subsets of the attributes such that none of them contains the other one (by the wellknown theorem of Sperner [8] their number is (\(^{~~n}_{n/2}\))) and let them all determine all the further values. However, we will show by a specific construction that it is possible to give more than (\(^{~~n}_{n/2}\)) independent dependencies (the construction will give (1 + \(\frac{1}{n^2}\)) (\(^{~~n}_{n/2}\)) of them) and — on the other hand — the upper bound is 2n–1, which is roughly \(\sqrt{n}(^{~~n}_{n/2})\).
The work was supported by the Hungarian National Foundation for Scientific Research grant numbers T037846 and AT048826.
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
Beeri, C., Dowd, M., Fagin, R., Statman, R.: On the structure of Armstrong relations for functional dependencies. Journal of ACM 31(1), 30–46 (1984)
Demetrovics, J., Katona, G.O.H.: Combinatorial problems of database models. In: Colloquia Mathematica Societatis Janos Bolyai, Gÿor, Hungary. Algebra, Cominatorics and Logic in Computer Science, vol. 42, pp. 331–352 (1983)
Demetrovics, J., Libkin, L., Muchnik, I.B.: Functional dependencies and the semilattice of closed classes. In: Demetrovics, J., Thalheim, B. (eds.) MFDBS 1989. LNCS, vol. 364, pp. 136–147. Springer, Heidelberg (1989)
Graham, R., Sloane, N.: Lower bounds for constant weight codes. IEEE Trans. Inform. Theory 26, 37–43 (1980)
Katona, G.O.H., Demetrovics, J.: A survey of some combinatorial results concerning functional dependencies in relational databases. Annals of Mathematics and Artificial Intelligence 6 (1992)
Mannila, H., Räihä, K.-J.: The design of relational databases. Addison-Wesley, Amsterdam (1992)
Seleznjev, O., Thalheim, B.: On the number of minimal keys in relational databases over nonuniform domains. Acta Cybern. 8, 267–271 (1988)
Sperner, E.: Ein Satz über Untermengen einer endlichen Menge. Math. Z. 27, 544–548 (1928)
Thalheim, B.: Open problems in relational database theory. Bull. EATCS 32, 336–337 (1987)
Thalheim, B.: Generalizing the entity-relationship model for database modeling. JNGCS 3(3), 197–212 (1990)
Thalheim, B.: Dependencies in Relational Databases. Teubner-Texte zur Mathematik, B.G. Teubner Verlagsgesellschaft, Stuttgrat - Leipzig (1991)
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
Demetrovics, J., Katona, G.O.H., Miklós, D., Thalheim, B. (2006). On the Number of Independent Functional Dependencies. 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_6
Download citation
DOI: https://doi.org/10.1007/11663881_6
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)