About possibilistic queries against possibilistic databases

Authors:
Patrick Bosc;Laurence Duval;Olivier Pivert
Affiliations:
IRISA/ENSSAT, Technopole ANTICIPA BP 447, 22305 Lannion Cedex France;ENSAI, Campus de Ker Lann, 35170 Bruz France;IRISA/ENSSAT, Technopole ANTICIPA BP 447, 22305 Lannion Cedex France
Venue:
Proceedings of the 2002 ACM symposium on Applied computing
Year:
2002

Citing 4
Cited 2

Incomplete Information in Relational Databases

Journal of the ACM (JACM)
Semantic representations and query languages for or-sets

PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A function-based join for the manipulation of possibilistic relations

Proceedings of the 2001 ACM symposium on Applied computing
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level

About Selections and Joins in Possibilistic Queries Addressed to Possibilistic Databases

DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
About the processing of possibilistic queries involving a difference operation

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is situated in the area of the so-called fuzzy databases, i.e., databases containing imprecise information. It is now recognized that querying databases containing imperfect information raises several problems, including complexity. In this paper, we consider a specific kind of queries, called possibilistic queries, of the form "to what extent is it possible that a given tuple t belongs to the answer of Q (a regular relational query)". The major objective is to show that a reasonable complexity can be expected for a specific (although not too restricted) subset of possibilistic queries.