Abstract

Abstract In this paper, fuzzy functional dependencies are represented by means of fuzzy similarity relations. We show that the inference rules for fuzzy functional dependencies, which are similar to Armstrong's Axioms for the classical case, are sound and complete. Making use of fuzzy functional dependencies, we can compress the domain of the fuzzy data and make the fuzzy data ‘clearer’. An algorithm for testing the satisfiability of a fuzzy instance for the set of fuzzy functional dependencies is given. Furthermore, we discuss the decomposition and join of relation schemes. We define the fuzzy consistent join and give its properties. Lastly, we obtain an algorithm for determining lossless consistent join.

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.