Efficient detection of minimal failing subqueries in a fuzzy querying context

Authors:
Olivier Pivert;Grégory Smits;Allel Hadjali;Hélène Jaudoin
Affiliations:
Irisa, Enssat, University of Rennes 1, Lannion Cedex, France;Irisa, IUT Lannion, University of Rennes 1, Lannion Cedex, France;Irisa, Enssat, University of Rennes 1, Lannion Cedex, France;Irisa, Enssat, University of Rennes 1, Lannion Cedex, France
Venue:
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Year:
2011

Citing 4
Cited 1

Retrieval Failure and Recovery in Recommender Systems

Artificial Intelligence Review
Incremental controlled relaxation of failing flexible queries

Journal of Intelligent Information Systems
Techniques for fast query relaxation in content-based recommender systems

KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
SQLf: a relational database language for fuzzy querying

IEEE Transactions on Fuzzy Systems

Applications of ordinal ranks to flexible query answering

SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with conjunctive fuzzy queries that yield an empty or unsatisfactory answer set. We propose a cooperative answering approach which efficiently retrieves the minimal failing subqueries of the initial query (which can then be used to explain the failure). The detection of the minimal failing subqueries relies on a prior step of fuzzy cardinalities computation. The main advantage of this strategy is to imply a single scan of the database. Moreover, the storage of such knowledge about the data distributions easily fits in memory.