scholarly journals A probabilistic relational database model and algebra

2015 ◽  
Vol 31 (4) ◽  
pp. 305
Author(s):  
Hoa Nguyen

This paper introduces a probabilistic relational database model, called PRDB, for representing and querying uncertain information of objects in practice. To develop the PRDB model, first, we represent the relational attribute value as a pair of probabilistic distributions on a set for modeling the possibility that the attribute can take one of the values of the set with a probability belonging to the interval which is inferred from the pair of probabilistic distributions. Next, on the basis representing such attribute values, we formally define the notions as the schema, relation, probabilistic functional dependency and probabilistic relational algebraic operations for PRDB. In addition, a set of the properties of the probabilistic relational algebraic operations in PRDB also are formulated and proven.

2019 ◽  
Vol 8 (2) ◽  
pp. 44-48
Author(s):  
Soumitra De ◽  
Jaydev Mishra

In order to model the imprecise and uncertain information, different classical relational data model have been studied in literature using vague set theory. However, neutrosophic set, as a generalized vague set, has more powerful ability to process fuzzy information than vague set. In this paper, we have proposed a neutrosophic relational database model and have defined a new kind of neutrosophic functional dependency (called  -nfd) based on the -equality of tuples and the similarity measure of neutrosophic sets. Next, we present a set of sound neutrosophic inference rules which are similar to Armstrong’s axioms for the classical case. Finally, partial  -nfdand neutrosophic key have been studied with the new notion of  -nfdand also tested.


Author(s):  
Hoa Nguyen

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.


2019 ◽  
Vol 35 (4) ◽  
pp. 355-372
Author(s):  
Hòa Nguyễn

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.


1980 ◽  
Vol 3 (3) ◽  
pp. 363-377
Author(s):  
John Grant

In this paper we investigate the inclusion of incomplete information in the relational database model. This is done by allowing nonatomic entries, i.e. sets, as elements in the database. A nonatomic entry is interpreted as a set of possible elements, one of which is the correct one. We deal primarily with numerical entries where an allowed set is an interval, and character string entries. We discuss the various operations of the relational algebra as well as the notion of functional dependency for the database model.


Author(s):  
Nguyen Hoa

This paper introduces a type-2 fuzzy relational database model (T-2FRDB) as an extension of type-1 fuzzy relational database models with a full set of basic fuzzy relational algebraic operations that can represent and query uncertain and imprecise information in real world applications. In this model, the membership degree of tuples in a fuzzy relation is represented by fuzzy numbers on [0,1], and fuzzy relational algebraic operations are defined by using the extension principle for computing minimum and maximum values of such fuzzy numbers. Some properties of the type-2 fuzzy relational algebraic operations in T-2FRDB are also formulated and proven as extensions of their counterpart in the type-1 fuzzy relational database models. DOI: 10.32913/rd-ict.vol3.no14.352


Sign in / Sign up

Export Citation Format

Share Document