Epsilon-nets and simplex range queries
SCG '86 Proceedings of the second annual symposium on Computational geometry
Fixed-precision estimation of join selectivity
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimal histograms for limiting worst-case error propagation in the size of join results
ACM Transactions on Database Systems (TODS)
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
On saying “Enough already!” in SQL
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
A Structured Approach for Cooperative Query Answering
IEEE Transactions on Knowledge and Data Engineering
Generalization and a Framework for Query Modification
Proceedings of the Sixth International Conference on Data Engineering
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
Robust query processing through progressive optimization
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Robust Cardinality and Cost Estimation for Skyline Operator
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Relaxing join and selection queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Efficient detection of empty-result queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Generating Queries with Cardinality Constraints for DBMS Testing
IEEE Transactions on Knowledge and Data Engineering
Supporting top-K join queries in relational databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Probabilistic ranking of database query results
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Generating targeted queries for database testing
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Relaxation in text search using taxonomies
Proceedings of the VLDB Endowment
How to ConQueR why-not questions
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
QRelX: generating meaningful queries that provide cardinality assurance
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Topological operators: a relaxed query processing approach
Geoinformatica
Towards relaxed selection and join queries over data streams
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
A framework for query refinement with user feedback
Journal of Systems and Software
On modeling query refinement by capturing user intent through feedback
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
Semantic to intelligent web era: building blocks, applications, and current trends
Proceedings of the Fifth International Conference on Management of Emergent Digital EcoSystems
A probabilistic optimization framework for the empty-answer problem
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
We investigate the problem of refining SQL queries to satisfy cardinality constraints on the query result. This has applications to the many/few answers problems often faced by database users. We formalize the problem of query refinement and propose a framework to support it in a database system. We introduce an interactive model of refinement that incorporates user feedback to best capture user preferences. Our techniques are designed to handle queries having range and equality predicates on numerical and categorical attributes. We present an experimental evaluation of our framework implemented in an open source data manager and demonstrate the feasibility and practical utility of our approach.