학술논문

Dependency preservation and lossless join decomposition in fuzzy normalization
Document Type
Conference
Source
International Conference on Computing, Communication & Automation Computing, Communication & Automation (ICCCA), 2015 International Conference on. :294-298 May, 2015
Subject
Communication, Networking and Broadcast Technologies
Computing and Processing
Relational databases
Cities and towns
Remuneration
Computational modeling
Algorithm design and analysis
Automation
fuzzy set
fuzzy functional dependency
fuzzy normal forms
fuzzy dependency preservation
fuzzy lossless join decomposition
Language
Abstract
The traditional relational database model may be extended into a fuzzy database model based on the mathematical framework of fuzzy set theory to process imprecise or uncertain information. While designing such a fuzzy relational database model that does not suffer from data redundancy and anomalies, the present authors have defined several fuzzy normal forms in ref [1]. However, as one decomposes an unnormalized relation into a desired normal form, it should also satisfy the essential properties of dependency preservation and lossless join of relation schemes which take a significant role in the design theory of a relational database. We have concentrated on these two important issues in this paper and have designed algorithms that confirm dependency preservation and lossless join decomposition of an unnormalized relation into the fuzzy third normal form or fuzzy Boyce Codd normal form. The algorithms have been tested and validated with examples.