zbMATH — the first resource for mathematics

Generalizing database relational algebra for the treatment of incomplete or uncertain information and vague queries. (English) Zbl 0552.68082
This paper deals with relational databases which are extended in the sense that fuzzily known values are allowed for attributes. Precise as well as partial (imprecise, uncertain) knowledge concerning the value of the attributes are represented by means of [0,1]-valued possibility distributions in Zadeh’s sense. Thus, we have to manipulate ordinary relations on Cartesian products of sets of fuzzy subsets rather than fuzzy relations. Besides, vague queries whose contents are also represented by possibility distributions can be taken into account. The basic operations of relational algebra, union, intersection, Cartesian product, projection, and selection are extended in order to deal with partial information and vague queries. Approximate equalities and inequalities modeled by fuzzy relations can also be taken into account in the selection operation. Then, the main features of a query language based on the extended relational algebra are presented. An illustrative example is provided. This approach, which enables a very general treatment of relational databases with fuzzy attribute values, makes an extensive use of dual possibility and necessity measures.

68P20 Information storage and retrieval of data
Full Text: DOI
[1] Baldwin, J.F., A fuzzy relational inference language for expert systems, (), 416-423
[2] Biskup, J., A formal approach to null values in database relations, ()
[3] Buckles, B.P.; Petry, F.E., A fuzzy representation of data for relational databases, Fuzzy sets and systems, 7, 213-226, (1982) · Zbl 0475.68059
[4] Buckles, B.P.; Petry, F.E., Fuzzy databases and their applications, (), 361-371 · Zbl 0564.68073
[5] Cayrol, M.; Farreny, H.; Prade, H., Possibility and necessity in a pattern matching process, (), 53-65
[6] Cayrol, M.; Farreny, H.; Prade, H., Fuzzy pattern matching, Kyberntes, 11, 103-116, (1982)
[7] Codd, E.F., Extending the database relational model to capture more meaning, ACM trans. database systems, 4, 4, 397-434, (1979)
[8] Date, C.J., An introduction to data base systems, (1977), Addison-Wesley · Zbl 0383.68019
[9] Dubois, D.; Prade, H., Fuzzy sets and systems: theory and applications, (1980), Academic · Zbl 0444.94049
[10] Dubois, D.; Prade, H., Ranking fuzzy numbers in the setting of possibility theory, Inform. sci., 30, 183-224, (1983) · Zbl 0569.94031
[11] Dubois, D.; Prade, H., Twofold fuzzy sets: an approach to the representation of sets with fuzzy boundaries based on possibility and necessity measures, J. math. (huazhong), 3, 4, 53-76, (1983) · Zbl 0562.54011
[12] Dubois, D.; Prade, H., Unfair coins and necessity measures. A possibilistic interpretation of histograms, Fuzzy sets and systems, 10, 1, 15-20, (1983) · Zbl 0515.60005
[13] Evrard, F.; Farreny, H.; Prade, H., A flexible interface for understanding task-oriented unconstrained natural language, Comput. and artificial intelligence (Bratislava), 2, 6, 497-511, (1983)
[14] Freksa, C., ()
[15] Grant, J., Partial values in a tabular database, Inform. process. lett., 9, 2, 97-99, (1979) · Zbl 0417.68084
[16] Haar, R.L., A fuzzy relational data base system, Computer center, univ. of maryland, TR-586, (1979)
[17] R. Le Faivre, The representation of fuzzy knowledge, J. Cybernet. 4(2):57-66.
[18] Lipski, W., On semantic issues connected with incomplete information data bases, ACM trans. database systems, 4, 3, 262-296, (1979)
[19] Lipski, W., On databases with incomplete information, J. assoc. comput. Mach., 28, 1, 41-70, (1981) · Zbl 0464.68086
[20] Montgomery, C.A.; Ruspini, E.H., The active information system: A data-driven system for the analysis of imprecise data, ()
[21] Narin’yani, A.S., Subdefinite set—a new data type for knowledge representation, (), (in Russian) · Zbl 0656.68116
[22] Philips, R.J.; Beaumont, M.J.; Richardson, D., \scaesop. an architectural relational database, Computer-aided design, 11, 4, 217-226, (1979)
[23] Prade, H., The connection between lipski’s approach to incomplete information data bases and Zadeh’s possibility theory, (), 402-408
[24] Prade, H., Possibility sets, fuzzy sets and their relation to łukasiewicz logic, (), 223-227
[25] Prade, H., Lipski’s approach to incomplete information databases restated and generalized in the setting of Zadeh’s possibility theory, Inform. systems, 9, 1, 27-42, (1984) · Zbl 0538.68078
[26] Prade, H., Do we need a precise definition of membership function?, (), 127, No. 14
[27] M. Umano, \scfreedom-o: A fuzzy database system, in Fuzzy Information and Decision Processes (M. M. Gupta and E. Sanchez, Eds.), North-Holland, pp. 339-347.
[28] Vassiliou, Y., Functional dependencies and incomplete information, (), 260-269
[29] Winston, P.H., Artificial intelligence, (1977), Addison-Wesley · Zbl 0358.68134
[30] Wong, E., A statistical approach to incomplete information in database systems, ACM trans. database systems, 7, 3, 470-488, (1982) · Zbl 0486.68111
[31] Yager, R.R., On the selection of objects having imprecise qualities, (), 28 · Zbl 0552.90054
[32] Zadeh, L.A., Fuzzy sets, Inform. and control, 8, 338-353, (1965) · Zbl 0139.24606
[33] Zadeh, L.A.; Zadeh, L.A.; Zadeh, L.A., The concept of a linguistic variable and its application to approximate reasoning, Inform. sci., Inform. sci., Inform. sci., 9, 43-80, (1975), Part 3 · Zbl 0404.68075
[34] Zadeh, L.A., Fuzzy sets as a basis for a theory of possibility, Fuzzy sets and systems, 1, 1, 3-28, (1978) · Zbl 0377.04002
[35] Zadeh, L.A., \scpruf: A meaning representation language for natural languages, Internat. J. man-machine studies, 10, 395-460, (1978) · Zbl 0406.68063
[36] Zadeh, L.A., Test-score semantics for natural languages and meaning representation via \scpruf, (), 281-349
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.