Classical Relational Database Model Research Articles

An Extended Type-2 Fuzzy Relational Database Model for Aggregate and Grouping Operations

This paper introduces an extended type-2 fuzzy relational database model (ET-2FRDB) for aggregate and grouping operations that can represent and query uncertain and imprecise information in the real world applications. In ET-2FRDB, each fuzzy relation is represented by a type-2 fuzzy set whose membership degree of each tuple is a fuzzy number on [0, 1], the fuzzy aggregate functions, the fuzzy relational algebraic, aggregate and grouping operations are defined as extensions of those in the classical relational database model thereby the membership degree of tuples associated by using the minimum and maximum of fuzzy numbers. Also, some properties of the fuzzy relational algebraic, aggregate and grouping operations in ET-2FRDB are formulated and proven.

A relational database model and algebra integrating fuzzy attributes and probabilistic tuples

Although there have been many fuzzy or probabilistic relational database models proposed for representing and handling imprecise and uncertain information of objects in real-world applications, models combining the relevance and strength of both fuzzy set theory and probability theory appear sporadic. In this paper, we propose a new fuzzy and probabilistic relational database model where the imprecision of an attribute value is represented by a fuzzy set and the uncertainty of a relational tuple is represented by a probability interval. The mass assignment theory is employed to deal with the challenge of integration and computation of both fuzzy sets and probabilities in the same model. The conjunction and disjunction strategies to combine imprecise and uncertain information are introduced. Then the fundamental concepts of the classical relational database model are extended and generalized in this new model. The syntax and semantics of the selection operation are formally defined. Finally, the other important algebraic operations on imprecise attributes and uncertain tuples are developed.

FUZZY RELATIONAL DATABASE MODEL AND MANAGEMANT SYSTEM FOR IMPRECISE INFORMATION

This paper introduces a fuzzy relational database model (FRDB) and the management system for it. FRDB is built by extending the classical relational database model with the fuzzy membership degree of tuples in relations. The management system for FRDB with the querying language like SQL is built by using a classical open-source management system.

A Hybrid Relational Database Model for Uncertain and Imprecise Information

Recent years, many fuzzy or probabilistic database models have been built for representing and handling imprecise or uncertain information of objects in real-world applications. However, relational database models combining the relevance and strength of both fuzzy set and probability theories have rarely been proposed. This paper introduces a new relational database model, as a hybrid one combining consistently fuzzy set theory and probability theory for modeling and manipulating uncertain and imprecise information, where the uncertainty and imprecision of a relational attribute value are represented by a fuzzy probabilistic triple, the computation and combination of relational attribute values are implemented by using the probabilistic interpretation of binary relations on fuzzy sets, and the elimination of redundant data is dealt with by coalescing e-equivalent tuples. The basic concepts of the classical relational database model are extended in this new model. Then the relational algebraic operations are formally defined accordingly. A set of the properties of the relational algebraic operations is also formulated and proven.

EXTENDING RELATIONAL DATABASE MODEL FOR UNCERTAIN INFORMATION

In this paper, we propose a new probabilistic relational database model, denote by PRDB, as an extension of the classical relational database model where the uncertainty of relational attribute values and tuples are respectively represented by finite sets and probability intervals. A probabilistic interpretation of binary relations on finite sets is proposed for the computation of their probability measures. The combination strategies on probability intervals are employed to combine attribute values and compute uncertain membership degrees of tuples in a relation. The fundamental concepts of the classical relational database model are extended and generalized for PRDB. Then, the probabilistic relational algebraic operations are formally defined accordingly in PRDB. In addition, a set of the properties of the algebraic operations in this new model also are formulated and proven.

Formal translation from fuzzy EER model to fuzzy XML model

XML has been the de facto standard of data representation and exchange over the Web. In addition, fuzzy data are inherent in the real-world applications. Although fuzzy information has been extensively investigated in the context of relational database model, the classical relational database model and its fuzzy extension to date do not satisfy the need of modeling and processing complex objects with imprecision and uncertainty on the Web. Based on fuzzy sets, this paper concentrates on fuzzy information modeling in the EER (enhanced entity-relationship or extended entity-relationship) model and the fuzzy XML model. In particular, the formal approach to mapping the fuzzy EER model to the fuzzy DTD (document type definition) model is developed.

Normalization and lossless join decomposition of similarity-based fuzzy relational databases

Fuzzy relational database models generalize the classical relational database model by allowing uncertain and imprecise information to be represented and manipulated. In this article, we introduce fuzzy extensions of the normal forms for the similarity-based fuzzy relational database model. Within this framework of fuzzy data representation, similarity, conformance of tuples, the concept of fuzzy functional dependencies, and partial fuzzy functional dependencies are utilized to define the fuzzy key notion, transitive closures, and the fuzzy normal forms. Algorithms for dependency preserving and lossless join decompositions of fuzzy relations are also given. We include examples to show how normalization, dependency preserving, and lossless join decomposition based on the fuzzy functional dependencies of fuzzy relation are done and applied to some real-life applications. © 2004 Wiley Periodicals, Inc. Int J Int Syst 19: 885–917, 2004.