Name
Abstract | ||
|---|---|---|
In this paper, we discuss an approach for relaxing a failing query in the context of flexible (or fuzzy) querying. The approach relies on the notion of a parameterized proximity relation which is defined in a relative way. We show how such a proximity relation allows for transforming a gradual predicate into an enlarged one. The resulting predicate is semantically close to the original one and it is obtained by a simple fuzzy arithmetic operation. Such a transformation provides the basis for a flexible query relaxation which can be controlled in a non-empirical rigorous way without requiring any additional information from the user. We also show how the search for a non-failing relaxed query over the lattice of relaxed queries can be improved by exploiting the notion of Minimal Failing Sub-queries derived from the failing query. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/s10844-008-0071-6 | Journal of Intelligent Information Systems |
Keywords | Field | DocType |
Flexible queries,Cooperative answers,Query relaxation,Proximity relation,Fuzzy number | Query optimization,Fuzzy arithmetic,Data mining,Parameterized complexity,Lattice (order),Computer science,Fuzzy logic,Algorithm,Predicate (grammar),Fuzzy number | Journal |
Volume | Issue | ISSN |
33 | 3 | 0925-9902 |
Citations | PageRank | References |
17 | 0.70 | 24 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Patrick Bosc | 1 | 601 | 75.23 |
| Allel Hadjali | 2 | 391 | 49.62 |
| Olivier Pivert | 3 | 891 | 101.81 |