An Equivalence Relation to Reduce Data Redundancy Based on Fuzzy Object Oriented Database System
Sujoy Dutta1, Laxman Sahoo2, Debasis Dwibedy3
1Sujoy Dutta, Computer Science and Engineering, Kalinga Institute of Industrial Technology (KIIT University), Bhubaneswar, India.
2Dr. Laxman Sahoo, Computer Science and Engineering, Kalinga Institute of Industrial Technology (KIIT University), Bhubaneswar, India.
3Dr. Laxman Sahoo, Computer Science and Engineering, Kalinga Institute of Industrial Technology (KIIT University), Bhubaneswar, India.
Manuscript received on April 04, 2013. | Revised Manuscript received on April 29, 2013. | Manuscript published on May 05, 2013. | PP: 417-421 | Volume-3, Issue-2, May 2013. | Retrieval Number: B1575053213/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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 , . 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.
Keywords: Domain partitions, Equivalence classes, Equivalence relations, Fuzzy relational databases, Relational algebra.