Fuzzy functional dependencies and lossless join decomposition of fuzzy relational database systems

K. V. S. V. N. Raju, A.K. Majumdar

ACM Transactions on Database Systems · 1988 · 409 citations · 42 references

DOIFull text

Open access

Concepts

TL;DR

This paper applies fuzzy logic to relational databases to capture richer data meaning. The authors investigate lossless join decomposition for fuzzy relations defined by fuzzy functional dependencies. They show that, with suitable membership functions and a fuzzy resemblance measure EQUAL, a fuzzy relational model can represent data ambiguities and imprecise associations, support relational operators and integrity constraints, generalize functional dependencies, and—under a restriction on EQUAL—extend classical lossless join decomposition theory to fuzzy relations.

Abstract

This paper deals with the application of fuzzy logic in a relational database environment with the objective of capturing more meaning of the data. It is shown that with suitable interpretations for the fuzzy membership functions, a fuzzy relational data model can be used to represent ambiguities in data values as well as impreciseness in the association among them. Relational operators for fuzzy relations have been studied, and applicability of fuzzy logic in capturing integrity constraints has been investigated. By introducing a fuzzy resemblance measure EQUAL for comparing domain values, the definition of classical functional dependency has been generalized to fuzzy functional dependency (ffd). The implication problem of ffds has been examined and a set of sound and complete inference axioms has been proposed. Next, the problem of lossless join decomposition of fuzzy relations for a given set of fuzzy functional dependencies is investigated. It is proved that with a suitable restriction on EQUAL, the design theory of a classical relational database with functional dependencies can be extended to fuzzy relations satisfying fuzzy functional dependencies.

References

42