Database querying in the presence of suspect values

Pivert, O; Prade, H

Database querying in the presence of suspect values

Pivert, O Prade, H

Permalink

Publication Type:: Conference Proceeding
Citation:: Communications in Computer and Information Science, 2015, 539 pp. 44 - 51
Issue Date:: 2015-01-01

Closed Access

	Filename	Description	Size
	PAC-10012293.pdf	Published version	3.97 MB	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-01-01	en_US
dc.identifier.citation	Communications in Computer and Information Science, 2015, 539 pp. 44 - 51	en_US
dc.identifier.isbn	9783319232003	en_US
dc.identifier.issn	1865-0929	en_US
dc.identifier.uri	http://hdl.handle.net/10453/120756
dc.description.abstract	© Springer International Publishing Switzerland 2015. In this paper, we consider the situation where a database may contain suspect values, i.e. precise values whose validity is not certain. We propose a database model based on the notion of possibilistic certainty to deal with such values. The operators of relational algebra are extended in this framework. A very interesting aspect is that queries have the same data complexity as in a classical database context.	en_US
dc.relation.ispartof	Communications in Computer and Information Science	en_US
dc.relation.isbasedon	10.1007/978-3-319-23201-0_6	en_US
dc.title	Database querying in the presence of suspect values	en_US
dc.type	Conference Proceeding
utslib.citation.volume	539	en_US
utslib.for	0806 Information Systems	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
pubs.volume	539	en_US

Abstract:

© Springer International Publishing Switzerland 2015. In this paper, we consider the situation where a database may contain suspect values, i.e. precise values whose validity is not certain. We propose a database model based on the notion of possibilistic certainty to deal with such values. The operators of relational algebra are extended in this framework. A very interesting aspect is that queries have the same data complexity as in a classical database context.

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

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