Abstract

This study develops the foundation for a simple, yet efficient method for uncovering functional and approximate functional dependencies in relational databases. The technique is based upon the mathematical theory of partitions defined over a relation's row identifiers. Using a levelwise algorithm the minimal non-trivial functional dependencies can be found using computations conducted on integers. Therefore, the required operations on partitions are both simple and fast. Additionally, the row identifiers provide the added advantage of nominally identifying the exceptions to approximate functional dependencies, which can be used effectively in practical data mining applications.

Highlights

  • The complexity of discovering functional dependencies has been studied in [5], [6], [7]

  • A functional dependency states that the value of an attribute is uniquely determined by the value of some other attributes

  • Suppose that a company sets up a database to keep track of its employees and the various departments to which they are assigned from time to time

Read more

Summary

Introduction

The complexity of discovering functional dependencies has been studied in [5], [6], [7]. Note that First name plus Family name determining Salary is an approximate functional dependency with a 25 percent error rate. The algorithm for discovering functional and approximate functional dependencies employed in this paper is similar to the levelwise approach for the discovery of association rules [1]. This search strategy first computes some non–trivial information about attribute sets, frequent item sets, and which association rules can be computed . Using rough sets [12] utilized rough sets for identifying the most critical factors for allowing for the elimination of irrelevant attributes in a relation prior to the generation of rules describing data dependencies in databases

Functional Dependencies and Partitions
Optimizations via Constrained Partitions
Searching for the Non-Trivial Minimal Functional Dependencies
Testing for Minimality of Functional Dependencies
Pruning the Set Containment Lattice
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.