Name
Abstract | ||
|---|---|---|
This paper deals with the querying of possibilistic relational databases, by means of queries called generalized yes/no queries, whose general form is: “to what extent is it possible that the answer to Q satisfies property P”. Here, property P concerns the inclusion in the result, of a set of tuples specified by the user. A processing technique for such queries is proposed, which avoids computing the worlds attached to the possibilistic database. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11875604_32 | ISMIS |
Keywords | Field | DocType |
general form,possibilistic relational databases,paper deal,possibilistic database context,processing technique,property p,possibilistic database,satisfiability,relational database | Data mining,Database query,Relational database,Computer science,Tuple,Possibility theory,Database | Conference |
Volume | ISSN | ISBN |
4203 | 0302-9743 | 3-540-45764-X |
Citations | PageRank | References |
1 | 0.35 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Patrick Bosc | 1 | 601 | 75.23 |
| Nadia Lietard | 2 | 1 | 0.35 |
| Olivier Pivert | 3 | 891 | 101.81 |