In this paper, we deal with the functional and approximate dependency inference problem by pointing out some relationships between relational database theory and Formal Concept Analysis. More precisely, the notion of functional dependency in database is compared to the notion of implication in Formal Concept Analysis. We propose a framework and several algorithms for mining these dependencies from large database relations. The common data centric step of this framework is the discovery of agree sets, which are closed sets with respect to the closure operator for functional dependency. Two approaches for discovering agree sets from database relations are proposed: the former is a database approach based on SQL queries and the latter is a data mining approach based on partitions. Experiments were performed in order to compare the two proposed methods.