DocumentCode
3395457
Title
A first approach to possibilistic queries addressed to possibilistic databases
Author
Bosc, Patrick ; Duval, Laurence ; Pivert, Olivier
Author_Institution
IRISA/ENSSAT, Lannion, France
Volume
4
fYear
2001
fDate
25-28 July 2001
Firstpage
2452
Abstract
It is now recognized that querying databases containing imprecise information raises several problems, including that of complexity. The authors consider a new kind of query, called possibilistic queries, of the form "to what extent is it possible that a given tuple t belongs to the answer of Q (a regular relational query)". The paper is a first attempt to show that a reasonable complexity can be expected for a specified subset of possibilistic queries
Keywords
computational complexity; fuzzy set theory; possibility theory; query processing; relational algebra; relational databases; uncertainty handling; complexity; database querying; imprecise information; possibilistic databases; possibilistic queries; relational query; tuple; Database systems; Fuzzy sets; Null value; Possibility theory; Proposals; Relational databases; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
IFSA World Congress and 20th NAFIPS International Conference, 2001. Joint 9th
Conference_Location
Vancouver, BC
Print_ISBN
0-7803-7078-3
Type
conf
DOI
10.1109/NAFIPS.2001.944457
Filename
944457
Link To Document