An efficient test of a database is to subject it to random queries that are likely to succeed when evaluated on the database. Currently, automated query generation is difficult to use to target specific query shapes and difficult to adapt to diverse purposes. This disclosure describes a framework for generating random database queries by generating relational algebra trees and by building a query string from the algebra tree. The techniques enable the generation of useful, syntactically correct queries tuned towards particular depths, operator types, subtree structures, etc. Interesting algebra shapes can be targeted to test specific areas efficiently.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.