About the processing of possibilistic and probabilistic queries

Authors:
Patrick Bosc;Olivier Pivert
Affiliations:
IRISA/ENSSAT, Technopole Anticipa, Lannion Cedex, France;IRISA/ENSSAT, Technopole Anticipa, Lannion Cedex, France
Venue:
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Year:
2005

Citing 3
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
Uncertainty Management in Information Systems: From Needs to Solutions

Uncertainty Management in Information Systems: From Needs to Solutions

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the issue of querying databases that may contain ill-known values represented by disjunctive weighted sets (possibility or probability distributions) is considered. The queries dealt with are of the form: “to what extent is it possible (or probable, depending on the framework considered) that tuple t belongs to the result of query Q”, where Q denotes a usual relational query. In the possibilistic database framework, some previous works resulted in the definition of an evaluation method that does not entail computing the different possible worlds of the database. In this paper, we show that this method cannot be used in the probabilistic database framework in general. On the other hand, we describe an alternative evaluation method that is suitable for probabilistic queries when Q complies with certain constraints.