"PAPERS"

DATA IS ONE OF AN ORGANIZATION'S MOST VALUABLE AND STRATEGIC ASSETS. TESTING THE RELATIONAL DATABASE SCHEMA, WHICH PROTECTS THE INTEGRITY OF THIS DATA, IS OF PARAMOUNT IMPORTANCE. MUTATION ANALYSIS IS A MEANS OF ESTIMATING THE FAULT-FINDING 'STRENGTH' OF A TEST SUITE. AS WITH PROGRAM MUTATION, HOWEVER, RELATIONAL DATABASE SCHEMA MUTATION RESULTS IN MANY INEFFECTIVE MUTANTS THAT BOTH DEGRADE TEST SUITE QUALITY ESTIMATES AND MAKE MUTATION ANALYSIS MORE TIME CONSUMING. THIS PAPER PRESENTS A TAXONOMY OF INEFFECTIVE MUTANTS FOR RELATIONAL DATABASE SCHEMAS, SUMMARIZING THE ROOT CAUSES OF INEFFECTIVENESS WITH A SERIES OF KEY PATTERNS EVIDENT IN DATABASE SCHEMAS. ON THE BASIS OF THESE, WE INTRODUCE ALGORITHMS THAT AUTOMATICALLY DETECT AND REMOVE INEFFECTIVE MUTANTS. IN AN EXPERIMENTAL STUDY INVOLVING THE MUTATION ANALYSIS OF 34 SCHEMAS USED WITH THREE POPULAR RELATIONAL DATABASE MANAGEMENT SYSTEMS --- HYPERSQL, POSTGRESQL, AND SQLITE --- THE RESULTS SHOW THAT OUR ALGORITHMS CAN IDENTIFY AND DISCARD LARGE NUMBERS OF INEFFECTIVE MUTANTS THAT CAN ACCOUNT FOR UP TO 24% OF MUTANTS, LEADING TO A CHANGE IN MUTATION SCORE FOR 33 OUT OF 34 SCHEMAS. THE TESTS FOR SEVEN SCHEMAS WERE FOUND TO ACHIEVE 100% SCORES, INDICATING THAT THEY WERE CAPABLE OF DETECTING AND KILLING ALL NON-EQUIVALENT MUTANTS. THE RESULTS ALSO REVEAL THAT THE EXECUTION COST OF MUTATION ANALYSIS MAY BE SIGNIFICANTLY REDUCED, ESPECIALLY WITH 'HEAVYWEIGHT' DBMSS LIKE POSTGRESQL.

DATA STORED IN RELATIONAL DATABASES PLAYS A VITAL ROLE IN MANY ASPECTS OF SOCIETY. WHEN THIS DATA IS INCORRECT, THE SERVICES THAT DEPEND ON IT MAY BE COMPROMISED. THE DATABASE SCHEMA IS THE ARTEFACT RESPONSIBLE FOR MAINTAINING THE INTEGRITY OF STORED DATA. BECAUSE OF ITS CRITICAL FUNCTION, THE PROPER TESTING OF THE DATABASE SCHEMA IS A TASK OF GREAT IMPORTANCE. EMPLOYING A SEARCH-BASED APPROACH TO GENERATE HIGH-QUALITY TEST DATA FOR DATABASE SCHEMAS, SCHEMAANALYST IS A TOOL THAT SUPPORTS TESTING THIS KEY SOFTWARE COMPONENT. THIS PRESENTED TOOL IS EXTENSIBLE AND INCLUDES BOTH AN EVALUATION FRAMEWORK FOR ASSESSING THE QUALITY OF THE GENERATED TESTS AND FULL-FEATURED DOCUMENTATION. IN ADDITION TO DESCRIBING THE DESIGN AND IMPLEMENTATION OF SCHEMAANALYST AND OVERVIEWING ITS EFFICIENCY AND EFFECTIVENESS, THIS PAPER COINCIDES WITH THE TOOL’S PUBLIC RELEASE, THEREBY ENHANCING PRACTITIONERS’ ABILITY TO TEST RELATIONAL DATABASE SCHEMAS.

MUTATION TESTING IS A WELL-KNOWN METHOD FOR MEASURING A TEST SUITE’S QUALITY. HOWEVER, DUE TO ITS COMPUTATIONAL EXPENSE AND INTRINSIC DIFFICULTIES (E.G., DETECTING EQUIVALENT MUTANTS AND POTENTIALLY CHECKING A MUTANT’S STATUS FOR EACH TEST), MUTATION TESTING IS OFTEN CHALLENGING TO PRACTICALLY USE. TO CONTROL THE COMPUTATIONAL COST OF MUTATION TESTING, MANY REDUCTION STRATEGIES HAVE BEEN PROPOSED (E.G., UNIFORM RANDOM SAMPLING OVER MUTANTS). YET, A STAND-ALONE TOOL TO COMPARE THE EFFICIENCY AND EFFECTIVENESS OF THESE METHODS IS HERETOFORE UNAVAILABLE. SINCE EXISTING MUTATION TESTING TOOLS ARE OFTEN COMPLEX AND LANGUAGE-DEPENDENT, THIS PAPER PRESENTS A TOOL, CALLED MRSTUDYR, THAT ENABLES THE 'RETROSPECTIVE' STUDY OF MUTANT REDUCTION METHODS USING THE DATA COLLECTED FROM A PRIOR ANALYSIS OF ALL MUTANTS. FOCUSING ON THE MUTATION OPERATORS AND THE MUTANTS THAT THEY PRODUCE, THE PRESENTED TOOL ALLOWS DEVELOPERS TO PROTOTYPE AND EVALUATE MUTANT REDUCERS WITHOUT BEING BURDENED BY THE IMPLEMENTATION DETAILS OF MUTATION TESTING TOOLS. ALONG WITH DESCRIBING MRSTUDYR’S DESIGN AND OVERVIEWING THE EXPERIMENTAL RESULTS FROM USING IT, THIS PAPER INAUGURATES THE PUBLIC RELEASE OF THIS OPEN-SOURCE TOOL.