A Model Based on Possibilistic Certainty Levels for Incomplete Databases

Authors:
Patrick Bosc;Olivier Pivert;Henri Prade
Affiliations:
Irisa --- Enssat, University of Rennes 1, Lannion Cedex, France 22305;Irisa --- Enssat, University of Rennes 1, Lannion Cedex, France 22305;IRIT, CNRS and University of Toulouse, Toulouse Cedex 9, France 31062
Venue:
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
Year:
2009

Citing 12
Cited 1

Incomplete Information in Relational Databases

Journal of the ACM (JACM)
ProbView: a flexible probabilistic database system

ACM Transactions on Database Systems (TODS)
On semantic issues connected with incomplete information databases

ACM Transactions on Database Systems (TODS)
Extending the database relational model to capture more meaning

ACM Transactions on Database Systems (TODS)
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Automated Reasoning Using Possibilistic Logic: Semantics, Belief Revision, and Variable Certainty Weights

IEEE Transactions on Knowledge and Data Engineering
Extension of the Relational Algebra to Probabilistic Complex Values

FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Working Models for Uncertain Data

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
ULDBs: databases with uncertainty and lineage

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Management of probabilistic data: foundations and challenges

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fast and Simple Relational Processing of Uncertain Data

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
About projection-selection-join queries addressed to possibilistic relational databases

IEEE Transactions on Fuzzy Systems

Dealing with explicit preferences and uncertainty in answer set programming

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the modeling and querying of a database 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 given tuple can take. This is represented in the setting of possibility theory. A relational database model suited to this context is introduced, and selection, join and union operators of relational algebra are extended so as to handle such relations. It is shown that i) the model in question is a strong representation system for the algebraic operators considered, and that ii) 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. A possibilistic logic encoding of the model is also outlined.