On the number of independent functional dependencies

TitleOn the number of independent functional dependencies
Publication TypeConference Paper
AuthorsDemetrovics, J., G. O. H. Katona, D. Miklos, and B. Thalheim
Year2006
Pages83 - 91
Conference NameLecture notes in computer science
Languageeng
ISBN Number0302-97433540317821
Notes

On the number of independent functional dependencies; 0302-9743

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 ( n by a specific construction that it is possible to give more than (n / n/2) independent dependencies (the construction will give (I + 1 / n(2))(n / n/2) of them) and – on the other hand – the upper bound is 2(n) – 1, which is roughly root n(n / n/2).