期刊名称：International Journal of Soft Computing & Engineering
电子版ISSN：2231-2307
出版年度：2013
卷号：3
期号：2
页码：417-421
出版社：International Journal of Soft Computing & Engineering
摘要：In this paper, a fuzzy equivalence relation is defined, generally, superseding most of the established results. The technique of employing sets of values for tuple components to express imprecision and redundancy in relational databases was proposed by Buckles and Petry in their classic works on fuzzy relational databases [1], [2]. By employing finite scalar domains with similarity relations and special fuzzy number domains, Buckles and Petry have demonstrated that the classical properties of uniqueness of tuple interpretations and well-definedness of the relational algebra can be retained in the fuzzy relational database model. The key to the preservation of these properties is the fact that scalar domains with similarity relations and the fuzzy number domains can be partitioned into equivalence classes. However, since equivalence classes can be constructed by assuming the existence of similarity relations, it is desirable to generalize the fuzzy relational database model to one based only on equivalence classes. In this work, we show that the important properties of classical relational databases (and of fuzzy relational databases) are preserved in a generalized model built on equivalence relations on finite database domains.
