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

Bosc, P; Pivert, O; Prade, H

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

Bosc, P Pivert, O Prade, H

Permalink

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

Closed Access

	Filename	Description	Size
	2013007808OK.pdf	Published version	266.87 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Bosc, P	en_US
dc.contributor.author	Pivert, O	en_US
dc.contributor.author	Prade, H https://orcid.org/0000-0003-4586-8527	en_US
dc.date.issued	2010-12-01	en_US
dc.identifier.citation	Proceedings of the 2010 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2010, 2010, pp. 63 - 68	en_US
dc.identifier.isbn	9781424478958	en_US
dc.identifier.uri	http://hdl.handle.net/10453/32828
dc.description.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. © 2010 IEEE.	en_US
dc.relation.ispartof	Proceedings of the 2010 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2010	en_US
dc.relation.isbasedon	10.1109/SOCPAR.2010.5686430	en_US
dc.title	An uncertain database model and a query algebra based on possibilistic certainty	en_US
dc.type	Conference Proceeding
utslib.for	0804 Data Format	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Software
pubs.organisational-group	/University of Technology Sydney/Strength - CAI - Centre for Artificial Intelligence
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

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. © 2010 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/32828