Mining Functional Dependency from Relational Databases by Removing Redundant Candidates
Anupama A Chavan1, Vijay Kumar Verma2
1Miss Anupama A Chavan, Department Of Computer Science and Engineering, Lord Krishna College of Technology, Indore, (M.P), India.
2Mr. Vijay Kumar Verma, Department Of Computer Science and Engineering, Lord Krishna College of Technology, Indore, (M.P), India.
Manuscript received on September 22, 2011. | Revised Manuscript received on October 01, 2011. | Manuscript published on October 30, 2013. | PP: 384-387 | Volume-3, Issue-1, October 2013. | Retrieval Number: A2297103113/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Discovery of functional dependencies from relational data base has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional dependencies from large databases, based on partitioning the set of rows with respect to their attribute values. The discovery of functional dependencies is easy and efficient due to use of partitions, and the wrong or exceptional rows can be recognized easily. By using this we can eliminate equivalence attribute and redundant dependency. For standard databases the running times are better by several orders of degree over previously published results. The proposed algorithm is also works well for larger datasets than the previous methods.
Keywords: Functional Dependencies, closure of set, Redundancy, Normalization.