A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
Generating Queries with Cardinality Constraints for DBMS Testing
2006
IEEE Transactions on Knowledge and Data Engineering
Good testing coverage of novel database techniques, such as multidimensional histograms or changes in the execution engine, is a complex problem. In this work, we argue that this task requires generating query instances, not randomly, but based on a given set of constraints. Specifically, obtaining query instances that satisfy cardinality constraints on their sub-expressions is an important challenge. We show that this problem is inherently hard, and develop heuristics that effectively find approximate solutions.
doi:10.1109/tkde.2006.190
fatcat:7xljr2ny2vawbl3u5c3kj5qe6u