Mutating database queries
TL;DR: A set of mutation operators for SQL queries that retrieve information from a database is developed and tested against a set of queries drawn from the NIST SQL Conformance Test Suite, and can be helpful in assessing the adequacy of database test cases and their development.
read more
Abstract: A set of mutation operators for SQL queries that retrieve information from a database is developed and tested against a set of queries drawn from the NIST SQL Conformance Test Suite. The mutation operators cover a wide spectrum of SQL features, including the handling of null values. Additional experiments are performed to explore whether the cost of executing mutants can be reduced using selective mutation or the test suite size can be reduced by using an appropriate ordering of the mutants. The SQL mutation approach can be helpful in assessing the adequacy of database test cases and their development, and as a tool for systematically injecting faults in order to compare different database testing techniques.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Table 7: Homogeneous subsets for the different orderings of the mutants (Tukey’s HSD Test) 
Table 8: Comparison of the mean number of test cases generated using different mutant orderings 
Figure 1: Boxplot for the total number of test cases generated under different mutant orderings 
Figure 2: Marginal means of the number of test cases under different orderings and quartiles 
Table 1: Mutations for conditions using tri-valued logic 
Table 2: Characteristics of the SQL suite
Citations
An Analysis and Survey of the Development of Mutation Testing
Yue Jia,Mark Harman +1 more
TL;DR: These analyses provide evidence that Mutation Testing techniques and tools are reaching a state of maturity and applicability, while the topic of Mutation testing itself is the subject of increasing interest.
1.8K
Mutation Testing Advances: An Analysis and Survey
Mike Papadakis,Marinos Kintis,Jie Zhang,Yue Jia,Yves Le Traon,Mark Harman +5 more
- 01 Jan 2019
TL;DR: This chapter presents a survey of recent advances, over the past decade, related to the fundamental problems of mutation testing and sets out the challenges and open problems for the future development of the method.
Higher Order Mutation Testing
Yue Jia,Mark Harman +1 more
- 01 Oct 2009
TL;DR: The paper introduces the concept of a subsuming HOM; one that is harder to kill than the first order mutants from which it is constructed, by definition, subsumed HOMs denote subtle fault combinations.
Sufficient mutation operators for measuring test effectiveness
Akbar Siami Namin,James H. Andrews,Duncan J. Murdoch +2 more
- 10 May 2008
TL;DR: This paper addresses the problem of finding a small set of mutation operators which is still sufficient for measuring test effectiveness by defining a statistical analysis procedure that allows it to identify such a set, together with an associated linear model that predicts mutation adequacy with high accuracy.
207
References
Hints on Test Data Selection: Help for the Practicing Programmer
TL;DR: In many cases tests of a program that uncover simple errors are also effective in uncovering much more complex errors, so-called coupling effect can be used to save work during the testing process.
2.2K
Software unit test coverage and adequacy
TL;DR: The notion of adequacy criteria is examined together with its role in software dynamic testing and the methods for comparison and assessment of criteria are reviewed.
Prioritizing test cases for regression testing
TL;DR: Test case prioritization techniques schedule test cases for execution in an order that attempts to increase their effectiveness at meeting some performance goal as discussed by the authors, such as rate of fault detection, a measure of how quickly faults are detected within the testing process.
1.3K
Prioritizing test cases for regression testing
Sebastian Elbaum,Alexey G. Malishevsky,Gregg Rothermel +2 more
- 01 Aug 2000
TL;DR: Can prioritization techniques be effective when aimed at specific modified versions; what tradeoffs exist between fine granularity and coarse granularity prioritized techniques; and can the incorporation of measures of fault proneness into prioritization technique improve their effectiveness?
Incomplete Information in Relational Databases
Tomasz Imielinski,Witold Lipski +1 more
TL;DR: There are precise conditions that should be satisfied in a semantically meaningful extension of the usual relational operators, such as projection, selection, union, and join, from operators on relations to operators on tables with “null values” of various kinds allowed.