An Analysis of the Effectiveness of Different Coverage Criteria for Testing Relational Database Schema Integrity Constraints

by Phil McMinn, Chris J. Wright and Gregory M. Kapfhammer

Technical Report (Department of Computer Science, University of Sheffield), 2015


A more recent and expanded journal version of this paper is available — see "The Effectiveness of Test Coverage Criteria for Relational Database Schema Integrity Constraints".


Despite industry advice to the contrary, there has been little work that has sought to test that a relational database’s schema has correctly specified integrity constraints. These critically important constraints ensure the coherence of data in a database, defending it from manipulations that could violate requirements such as “usernames must be unique” or “the host name cannot be missing or unknown”. This paper is the first to propose coverage criteria, derived from logic coverage criteria, that establish different levels of testing for the formulation of integrity constraints in a database schema. These range from simple criteria that mandate the testing ... [more]


Reference

Phil McMinn, Chris J. Wright and Gregory M. Kapfhammer. An Analysis of the Effectiveness of Different Coverage Criteria for Testing Relational Database Schema Integrity Constraints. Department of Computer Science, University of Sheffield Technical Report CS-15-01, 2015


Bibtex Entry
@techreport{McMinn2015,
  author      = "McMinn, Phil and Wright, Chris J. and Kapfhammer, Gregory M.",
  title       = "An Analysis of the Effectiveness of Different Coverage Criteria for Testing Relational Database Schema Integrity Constraints",
  number      = "CS-15-01",
  year        = "2015",
  institution = "Department of Computer Science, University of Sheffield"
}