Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Semantic representations and query languages for or-sets
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A function-based join for the manipulation of possibilistic relations
Proceedings of the 2001 ACM symposium on Applied computing
About possibilistic queries against possibilistic databases
Proceedings of the 2002 ACM symposium on Applied computing
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Hi-index | 0.00 |
This paper is situated in the area of the so-called fuzzy databases, i.e., databases containing imprecise information. It is now recognized that querying databases containing imperfect information raises several problems, including complexity. In this paper, we consider a specific kind of queries, 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 major objective is to show that a reasonable complexity can be expected for a specific (although not too restricted) subset of possibilistic queries.