Functional dependencies with null values, fuzzy values, and crisp values

Authors:
S. Y. Liao;H. Q. Wang;W. Y. Liu
Affiliations:
Dept. of Inf. Syst., City Univ. of Hong Kong, Kowloon;-;-
Venue:
IEEE Transactions on Fuzzy Systems
Year:
1999

Citing 0
Cited 4

Using imprecise analogical reasoning to refine the query answers for heterogeneous multidatabase systems in virtual enterprises

Data mining for design and manufacturing
Fuzzy functional dependencies and Bayesian networks

Journal of Computer Science and Technology
A fuzzy approach to classification of text documents

Journal of Computer Science and Technology
Using fuzzy analogical reasoning to refine the query answers for relational databases with imprecise information

FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on the concepts of the semantic proximity, we present a definition of the fuzzy functional dependency, We show that the inference rules for fuzzy functional dependencies, which are the same as Armstrong's axioms for the crisp case, are correct and complete. We also show that dependent constraints with dull values constitute a lattice. Functional dependencies in classical relational databases and null functional dependencies can be viewed as a special case of fuzzy functional dependencies. By applying the unified functional dependencies to the relational database design, we can represent the data with fuzzy values, null values and crisp values under relational database management systems, By using fuzzy functional dependencies, we can compress the range of a fuzzy value and make this fuzzy value “clearer”