QRelX: generating meaningful queries that provide cardinality assurance

Authors:
Manasi Vartak;Venkatesh Raghavan;Elke A. Rundensteiner
Affiliations:
Worcester Polytechnic Institute, Worcester, MA, USA;Worcester Polytechnic Institute, Worcester, MA, USA;Worcester Polytechnic Institute, Worcester, MA, USA
Venue:
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Year:
2010

Citing 7
Cited 0

On saying “Enough already!” in SQL

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
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
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
Generating targeted queries for database testing

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Interactive query refinement

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many business and consumer applications, queries have cardinality constraints. However, current database systems provide minimal support for cardinality assurance. Consequently, users must adopt a cumbersome trial-and-error approach to find queries that are close to the original query but also attain the desired cardinality. In this demonstration, we present QRelX a novel framework to automatically generate alternate queries that meet the cardinality and closeness criteria. QRelX employs an innovative query space transformation strategy, proximity-based search and incremental cardinality estimation to efficiently find alternate queries. Our demonstration is an interactive game that allows the audience to compete with QRelX via manual query refinement. We illustrate the importance of cardinality assurance through real-time comparisons between manual refinement and QRelX. We also highlight the novelty of our solution by visualizing the core algorithms of QRelX.