About inclusion-based generalized yes/no queries in a possibilistic database context

Authors:
Patrick Bosc;Nadia Lietard;Olivier Pivert
Affiliations:
IRISA/Enssat, Technopole Anticipa, Lannion, France;IRISA/Enssat, Technopole Anticipa, Lannion, France;IRISA/Enssat, Technopole Anticipa, Lannion, France
Venue:
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Year:
2006

Citing 4
Cited 0

Incomplete Information in Relational Databases

Journal of the ACM (JACM)
On the representation and querying of sets of possible worlds

Selected papers of the workshop on Deductive database theory
About yes/no queries against possibilistic databases: Research Articles

International Journal of Intelligent Systems
About projection-selection-join queries addressed to possibilistic relational databases

IEEE Transactions on Fuzzy Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the querying of possibilistic relational databases, by means of queries called generalized yes/no queries, whose general form is: “to what extent is it possible that the answer to Q satisfies property P”. Here, property P concerns the inclusion in the result, of a set of tuples specified by the user. A processing technique for such queries is proposed, which avoids computing the worlds attached to the possibilistic database.