A Certainty-Based Model for Uncertain Databases

Pivert, O; Prade, H

A Certainty-Based Model for Uncertain Databases

Pivert, O Prade, H

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Fuzzy Systems, 2015, 23 (4), pp. 1181 - 1196
Issue Date:: 2015-08-01

Closed Access

	Filename	Description	Size
	06878441.pdf	Published Version	498.41 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	Pivert, O	en_US
dc.contributor.author	Prade, H https://orcid.org/0000-0003-4586-8527	en_US
dc.date.issued	2015-08-01	en_US
dc.identifier.citation	IEEE Transactions on Fuzzy Systems, 2015, 23 (4), pp. 1181 - 1196	en_US
dc.identifier.issn	1063-6706	en_US
dc.identifier.uri	http://hdl.handle.net/10453/121582
dc.description.abstract	© 1993-2012 IEEE. This paper considers relational databases containing uncertain attribute values when some knowledge is available about the more or less certain value (or disjunction of values) that a given attribute in a tuple may take. We propose a possibility-theory-based model suited to this context and extend the operators of relational algebra to handle such relations in a 'compact,' thus efficient, way. It is shown that the model is a 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.	en_US
dc.relation.ispartof	IEEE Transactions on Fuzzy Systems	en_US
dc.relation.isbasedon	10.1109/TFUZZ.2014.2347994	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	A Certainty-Based Model for Uncertain Databases	en_US
dc.type	Journal Article
utslib.citation.volume	4	en_US
utslib.citation.volume	23	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
utslib.for	0906 Electrical and Electronic Engineering	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.issue	4	en_US
pubs.publication-status	Published	en_US
pubs.volume	23	en_US

Abstract:

© 1993-2012 IEEE. This paper considers relational databases containing uncertain attribute values when some knowledge is available about the more or less certain value (or disjunction of values) that a given attribute in a tuple may take. We propose a possibility-theory-based model suited to this context and extend the operators of relational algebra to handle such relations in a 'compact,' thus efficient, way. It is shown that the model is a 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.

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

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