loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Generating Queries with Cardinality Constraints for DBMS Testing
December 2006 (vol. 18 no. 12)
pp. 1721-1725
ASCII Text
x 
 
Nicolas Bruno, Surajit Chaudhuri, Dilys Thomas, "Generating Queries with Cardinality Constraints for DBMS Testing," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 12, pp. 1721-1725, December, 2006.
 
 
BibTex
x
 
@article{ 10.1109/TKDE.2006.190,
author = {Nicolas Bruno and Surajit Chaudhuri and Dilys Thomas},
title = {Generating Queries with Cardinality Constraints for DBMS Testing},
journal ={IEEE Transactions on Knowledge and Data Engineering},
volume = {18},
number = {12},
issn = {1041-4347},
year = {2006},
pages = {1721-1725},
doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.190},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Knowledge and Data Engineering
TI - Generating Queries with Cardinality Constraints for DBMS Testing
IS - 12
SN - 1041-4347
SP1721
EP1725
EPD - 1721-1725
A1 - Nicolas Bruno,
A1 - Surajit Chaudhuri,
A1 - Dilys Thomas,
PY - 2006
KW - Query generation
KW - database testing
KW - cardinality constraints.
VL - 18
JA - IEEE Transactions on Knowledge and Data Engineering
ER -
 
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 subexpressions is an important challenge. We show that this problem is inherently hard, and develop heuristics that effectively find approximate solutions.

[1] N. Bruno and S. Chaudhuri, “Flexible Database Generators,” Proc. 31st Int'l Conf. Very Large Databases (VLDB), 2005.
[2] A. Neufeld, G. Moerkotte, and P.C. Lockemann, “Generating Consistent Test Data for a Variable Set of General Consistency Constraints,” VLDB J., vol. 2, no. 2, 1993.
[3] D.R. Slutz, “Massive Stochastic Testing of SQL,” Proc. 24th Int'l Conf. Very Large Databases (VLDB), 1998.
[4] M. Poess and J.M. Stephens, “Generating Thousand Benchmark Queries in Seconds,” Proc. 30th Int'l Conf. Very Large Databases (VLDB), 2004.
[5] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press, 2001.
[6] V. Poosala, Y.E. Ioannidis, P.J. Haas, and E.J. Shekita, “Improved Histograms for Selectivity Estimation of Range Predicates,” Proc. ACM Int'l Conf. Management of Data SIGMOD, 1996.
[7] V. Chvatal, Linear Programming. W.H. Freeman, 1983.
[8] S. Haykin, Adaptive Filtering Theory, chapter 9. Prentice Hall, 2002.

Index Terms:
Query generation, database testing, cardinality constraints.
Citation:
Nicolas Bruno, Surajit Chaudhuri, Dilys Thomas, "Generating Queries with Cardinality Constraints for DBMS Testing," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 12, pp. 1721-1725, Dec. 2006, doi:10.1109/TKDE.2006.190
Usage of this product signifies your acceptance of the Terms of Use.