Automatic generation of test data for relational queries
From MaRDI portal
The problem of generating good test databases is presented. The concept is characterized by Armstrong databases generated by using two techniques. The first technique, based on taking unions of databases, is very general, but produces rather large databases. The second technique is based on chasing a collection of counterexamples; it produces smaller databases and applies rather well to some types of queries. These methods of producing test databases are based on the semantics of the queries and not on their structure.
Recommendations
Cites work
- Algebraic dependencies
- Armstrong databases for functional and inclusion dependencies
- Design by example: An application of Armstrong relations
- Equivalences among Relational Expressions
- scientific article; zbMATH DE number 3890770 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- On the Structure of Armstrong Relations for Functional Dependencies
- Two notions of correctness and their relation to testing
Cited in
(7)- Declarative testing of logic databases
- Qex: symbolic SQL query explorer
- Applying constraint logic programming to SQL test case generation
- Privacy preserving database generation for database application testing
- scientific article; zbMATH DE number 2011638 (Why is no real title available?)
- Database slicing on relational databases
- Characterising modal formulas with examples
This page was built for publication: Automatic generation of test data for relational queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823740)