Functional Dependency is a fundamental notion of the Relational Model. Since the introduction of this successful theoretical framework in the 70’s, there have been several works focussed on their automated treatment. The pioneer line of this area was the use of Functional Dependencies Logics. Unfortunately, this line has presented several limitations, most of them caused by the crucial role of the transitivity paradigm in the axiomatic system. In [11] we introduce a new Functional Dependencies Logic which does not use the transitivity rule. This logic uses a new substitution rule and the design of its axiomatic system has been guided by the notion of optimality.
In this paper we show the advantages of such a logic. We introduce a pre-processing transformation which removes redundancy of a given set of Functional Dependencies and allows a more efficient further treatment by other well known indirect algorithms. Besides that, we carry out an empirical study to prove the practical benefits of our approach.