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

Publication Type:
Conference Proceeding
Citation:
Proceedings of the 2010 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2010, 2010, pp. 63 - 68
Issue Date:
2010-12-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013007808OK.pdf Published version266.87 kB
Adobe PDF
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. © 2010 IEEE.
Please use this identifier to cite or link to this item: