Skip to Main content Skip to Navigation
Conference papers

An uncertain database model and a query algebra based on possibilistic certainty

Patrick Bosc 1 Olivier Pivert 1 Henri Prade 2 
1 PILGRIM - Gradedness, Imprecision, and Mediation in Database Management Systems
IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
2 IRIT-ADRIA - Argumentation, Décision, Raisonnement, Incertitude et Apprentissage
IRIT - Institut de recherche en informatique de Toulouse
Abstract : In this paper, we consider relational databases containing uncertain attribute values, in the situation where some knowledge is available about the more or less certain value (or disjunction of values) that a given attribute in a tuple can take. We propose a possibility-theory-based model suited to this context and extend the operators of relational algebra in order to handle such relations in a “compact” thus efficient way. It is shown that the proposed model is a strong representation system for the whole relational algebra. An important result is that the data complexity associated with the extended operators in this context is the same as in the classical database case, which makes the approach highly scalable.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00534246
Contributor : Olivier Pivert Connect in order to contact the contributor
Submitted on : Tuesday, November 9, 2010 - 10:36:45 AM
Last modification on : Monday, July 4, 2022 - 8:45:43 AM

Identifiers

Citation

Patrick Bosc, Olivier Pivert, Henri Prade. An uncertain database model and a query algebra based on possibilistic certainty. 2nd International Conference on Soft Computing and Pattern Recognition (SoCPaR 2010), Dec 2010, Cergy-Pontoise, France. ⟨10.1109/SOCPAR.2010.5686430⟩. ⟨inria-00534246⟩

Share

Metrics

Record views

161