Computational geometry: an introduction
Computational geometry: an introduction
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
Adaptive multi-stage distance join processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Minimal probing: supporting expensive predicates for top-k queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Cooperative Answering through Controlled Query Relaxation
IEEE Expert: Intelligent Systems and Their Applications
Proceedings of the 17th International Conference on Data Engineering
Evaluating Top-k Selection Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Preference formulas in relational queries
ACM Transactions on Database Systems (TODS)
Machine learning for online query relaxation
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
RankSQL: query algebra and optimization for relational top-k queries
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Maximal vector computation in large data sets
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Efficient computation of the skyline cube
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Catching the best views of skyline: a semantic approach based on decisive subspaces
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Foundations of preferences in database systems
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Online query relaxation via Bayesian causal structures discovery
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Query relaxation using malleable schemas
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Fast best-effort pattern matching in large attributed graphs
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Stretch 'n' shrink: resizing queries to user preferences
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Output perturbation with query relaxation
Proceedings of the VLDB Endowment
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient interactive fuzzy keyword search
Proceedings of the 18th international conference on World wide web
Efficient approximate search on string collections
Proceedings of the VLDB Endowment
Adaptive relaxation for querying heterogeneous XML data sources
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
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Querying databases with taxonomies
ER'10 Proceedings of the 29th international conference on Conceptual modeling
Data cleaning and query answering with matching dependencies and matching functions
Proceedings of the 14th International Conference on Database Theory
Skyline and mapping aware join query evaluation
Information Systems
Skyline query processing over joins
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Faerie: efficient filtering algorithms for approximate dictionary-based entity extraction
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient fuzzy full-text type-ahead search
The VLDB Journal — The International Journal on Very Large Data Bases
ReDRIVE: result-driven database exploration through recommendations
Proceedings of the 20th ACM international conference on Information and knowledge management
Efficient query rewrite for structured web queries
Proceedings of the 20th ACM international conference on Information and knowledge management
Topological operators: a relaxed query processing approach
Geoinformatica
On the complexity of package recommendation problems
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
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
User feedback based query refinement by exploiting skyline operator
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
YmalDB: a result-driven recommendation system for databases
Proceedings of the 16th International Conference on Extending Database Technology
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
A probabilistic optimization framework for the empty-answer problem
Proceedings of the VLDB Endowment
YmalDB: exploring relational databases via result-driven recommendations
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
Database users can be frustrated by having an empty answer to a query. In this paper, we propose a framework to systematically relax queries involving joins and selections. When considering relaxing a query condition, intuitively one seeks the 'minimal' amount of relaxation that yields an answer. We first characterize the types of answers that we return to relaxed queries. We then propose a lattice based framework in order to aid query relaxation. Nodes in the lattice correspond to different ways to relax queries. We characterize the properties of relaxation at each node and present algorithms to compute the corresponding answer. We then discuss how to traverse this lattice in a way that a non-empty query answer is obtained with the minimum amount of query condition relaxation. We implemented this framework and we present our results of a thorough performance evaluation using real and synthetic data. Our results indicate the practical utility of our framework.