Generating Queries with Cardinality Constraints for DBMS Testing

Generating Queries with Cardinality Constraints for DBMS Testing

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on knowledge and data engineering 2006-12, Vol.18 (12), p.1721-1725
Hauptverfasser: Bruno, N., Chaudhuri, S., Thomas, D.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Approximation
cardinality constraints
Computer science
control theory
systems
Data base management systems
Data processing. List processing. Character string processing
Database systems
database testing
Engines
Exact sciences and technology
Force control
Heuristic
Histograms
Information systems. Data bases
Memory management
Memory organisation. Data processing
Multidimensional systems
Queries
Query generation
Size control
Software
Tasks
Testing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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
ISSN:1041-4347
1558-2191
DOI:10.1109/TKDE.2006.190