Computing non-redundant sets of functional dependencies via simplification
- Resource Type
- Conference
- Authors
- Cordero, Pablo; Enciso, Manuel; Mora, Angel; Manuel, Jose
- Source
- 2013 IEEE Symposium on Foundations of Computational Intelligence (FOCI) Foundations of Computational Intelligence (FOCI), 2013 IEEE Symposium on. :9-14 Apr, 2013
- Subject
- Computing and Processing
Robotics and Control Systems
Signal Processing and Analysis
Databases
Redundancy
Context
Educational institutions
Semantics
Computational intelligence
Inference algorithms
- Language
Functional dependencies may be considered the skeleton of the Relational Database Model. They describe binary relations between sets of attributes and they characterize the database structure. A way to ensure solid specifications is to transform set of functional dependencies into an equivalent one with less redundancy. In this work we consider a fuzzy extension of the notion of functional dependencies which is consistent with the Armstrong axioms. We improve the well known notion of Duquenne-Guigues basis by enriching the minimality criteria and we introduce a method to remove redundancy in the basis.