๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Unacceptable components in fuzzy relational databases

โœ Scribed by Michinori Nakata


Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
850 KB
Volume
11
Category
Article
ISSN
0884-8173

No coin nor oath required. For personal study only.

โœฆ Synopsis


The existence of unacceptable components, which consist of unacceptable tuples and elements in attribute values, is shown in fuzzy relational databases. The unacceptable components are created by update operations, insertion, deletion, and modification. An unacceptable tuple in a relation is a tuple such that the degree of its not belonging to that relation is greater than that of its belonging to. The unacceptable tuple can be easily eliminated from relations. There are three kinds of unacceptable eleme~ts. One case of unacceptable elements is a redundant element created by insertion and modification. Another is an element created by a possible tuple value not at all or partially satisfying integrity constraints in insertion and modification. The other is an element created by a possible tuple value completely or partially satisfying update conditions in deletion. The unacceptable elements can be eliminated from relations without loss of information. As a result, we can obtain fuzzy relational databases without unacceptable components by a reasonable way.


๐Ÿ“œ SIMILAR VOLUMES


Fuzzy identification in fuzzy databases:
โœ Noureddine Mouaddib ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 600 KB

In the present article we review the main research works in fuzzy databases; propose an extension of relation division operator to fuzzy databases; provide a model for fuzzy information and resolve the identification problem in fuzzy databases. For this, three notions are relevant: (a) the concept o

Querying fuzzy relational databases thro
โœ Josรฉ Galindo; Juan Miguel Medina; Mยช Carmen Aranda ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 252 KB

ยดยดร n this paper we present a definition of a domain relational calculus for fuzzy relational databases using the GEFRED model as a starting point. It is possible to define an equivalent fuzzy tuple relational calculus and consequently we achieve the two query language levels that Codd designed for

Handling fuzzy information in extended p
โœ Z. M. Ma; F. Mili ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 111 KB

Two kinds of fuzziness in attribute values of the fuzzy relational databases can be distinguished: One is that attribute values are possibility distributions, and the other is that there are resemblance relations in attribute domains. The fuzzy relational databases containing these two kinds of fuzz

A logic approach to fuzzy relational dat
โœ M. A. Vila; J. C. Cubero; J. M. Medina; O. Pons ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 595 KB

A new definition of Fuzzy Relational Database is given by using logical concepts. With this definition it is possible to consider several kinds of fuzziness for the database attributes. A Domain Calculus-based query language is also established for the model. It allows us to formulate several types

A new definition of fuzzy functional dep
โœ J. C. Cubero; M. A. Vila ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 418 KB

The need to incorporate and treat information given in fuzzy terms in Relational Databases has concentrated a great effort in the last years. This article focuses on the treatment of functional dependencies (f.d.1 between attributes of a relation scheme. We review other approaches to this problem an