SEAVE: a mechanism for verifying user presuppositions in query systems
ACM Transactions on Information Systems (TOIS)
Query answering via cooperative data inference
Journal of Intelligent Information Systems
CoBase: a scalable and extensible cooperative information system
Journal of Intelligent Information Systems - Special issue on intelligent integration of information
An error-based conceptual clustering method for providing approximate query answers
Communications of the ACM - Electronic supplement to the December issue
FLEX: A Tolerant and Cooperative User Interface to Databases
IEEE Transactions on Knowledge and Data Engineering
Cooperative Answering through Controlled Query Relaxation
IEEE Expert: Intelligent Systems and Their Applications
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Machine learning for online query relaxation
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Relaxing join and selection queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Query result ranking over e-commerce web databases
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Query processing over incomplete autonomous databases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Alternatives to conjunctive query processing in peer-to-peer file-sharing systems
Proceedings of the 2009 ACM symposium on Applied Computing
The VLDB Journal — The International Journal on Very Large Data Bases
Incremental controlled relaxation of failing flexible queries
Journal of Intelligent Information Systems
An effective query relaxation solution for the deep web
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
How to ConQueR why-not questions
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Hi-index | 0.00 |
We introduce a novel algorithm, TOQR, for relaxing failed queries over databases, that is, over-constrained DNF queries that return an empty result. TOQR uses a small dataset to discover the implicit relationships among the domain attributes, and then it exploits this domain knowledge to relax the failed query. TOQR starts with a relaxed query that does not include any constraint, and it tries to add to it as many as possible of the original constraints or their relaxations. The order in which the constraints are added is derived from the domain's causal structure, which is learned by applying the TAN algorithm to the small training dataset. Our experiments show that TOQR clearly outperforms other approaches: even when trained on a handful of examples, it successfully relaxes more that 97% of the failed queries; furthermore, TOQR'S relaxed queries are highly similar to the original failed query.