A Model Based on Possibilistic Certainty Levels for Incomplete Databases

  • Patrick Bosc
  • Olivier Pivert
  • Henri Prade
Conference paper

DOI: 10.1007/978-3-642-04388-8_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5785)
Cite this paper as:
Bosc P., Pivert O., Prade H. (2009) A Model Based on Possibilistic Certainty Levels for Incomplete Databases. In: Godo L., Pugliese A. (eds) Scalable Uncertainty Management. SUM 2009. Lecture Notes in Computer Science, vol 5785. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Patrick Bosc
    • 1
  • Olivier Pivert
    • 1
  • Henri Prade
    • 2
  1. 1.Irisa – EnssatUniversity of Rennes 1Lannion CedexFrance
  2. 2.IRITCNRS and University of ToulouseToulouse Cedex 9France

Personalised recommendations