The document describes a search-based technique called SchemaAnalyst for automatically generating test data to test the integrity constraints of relational database schemas. It aims to address the lack of database testing which leads to $611 billion in annual losses due to poor data quality. SchemaAnalyst uses search-based optimization to generate test data that violates constraints to test schemas across multiple database management systems. An empirical study found SchemaAnalyst could effectively detect defects in schemas.
The document describes evaluating dynamic linking through the query process using the Licas test platform. It summarizes recent test results on the query test process that supports previous findings and shows the effectiveness of the linking mechanism in new test scenarios. The linking mechanism can dynamically link information sources based on query values. A query system generates random networks and queries to test how well the system optimizes query performance by reducing the search process while maintaining answer quality. Test results show the linking mechanism remains effective.
Implemenation of Enhancing Information Retrieval Using Integration of Invisib...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
We are good IEEE java projects development center in Chennai and Pondicherry. We guided advanced java technologies projects of cloud computing, data mining, Secure Computing, Networking, Parallel & Distributed Systems, Mobile Computing and Service Computing (Web Service).
For More Details:
http://jpinfotech.org/final-year-ieee-projects/2014-ieee-projects/java-projects/
Question Answering over Linked Data - Reasoning IssuesMichael Petychakis
Question answering system plays a vital role in search engine optimization model. Natural language processing methods are typically applied in QA system for inquiring user’s question and numerous steps are also followed for alteration of questions to query form for receiving a precise answer. This presentation analyzes diverse question answering systems that are based on semantic web technologies and ontologies with different formats of queries.It ends by addressing various reasoning alternatives.
Deriving an Emergent Relational Schema from RDF DataGraph-TA
This document discusses deriving an emergent relational schema from RDF data. It describes extracting characteristic sets from RDF data to recognize classes and relationships between classes. These characteristic sets are then merged and labeled to create a logical relational schema. This emergent schema provides benefits for both systems through improved efficiency and humans through easier query formulation over the RDF data. Key aspects of a useful emergent schema are discussed such as being compact, having human-friendly labels, providing high coverage of the RDF data, and being efficient to compute. Experimental results on real-world RDF datasets show the approach produces compact schemas with high coverage and understandable labels that improve performance over the native RDF representation.
MongoDB is a document-oriented database that bridges the gap between key-value stores and traditional relational databases. It uses collections of BSON documents (similar to JSON objects) rather than tables. Queries in MongoDB use JSON-like documents rather than SQL. MongoDB also supports features like embedded documents, dynamic schemas, rich queries and indexing to improve performance.
The document describes evaluating dynamic linking through the query process using the Licas test platform. It summarizes recent test results on the query test process that supports previous findings and shows the effectiveness of the linking mechanism in new test scenarios. The linking mechanism can dynamically link information sources based on query values. A query system generates random networks and queries to test how well the system optimizes query performance by reducing the search process while maintaining answer quality. Test results show the linking mechanism remains effective.
Implemenation of Enhancing Information Retrieval Using Integration of Invisib...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
We are good IEEE java projects development center in Chennai and Pondicherry. We guided advanced java technologies projects of cloud computing, data mining, Secure Computing, Networking, Parallel & Distributed Systems, Mobile Computing and Service Computing (Web Service).
For More Details:
http://jpinfotech.org/final-year-ieee-projects/2014-ieee-projects/java-projects/
Question Answering over Linked Data - Reasoning IssuesMichael Petychakis
Question answering system plays a vital role in search engine optimization model. Natural language processing methods are typically applied in QA system for inquiring user’s question and numerous steps are also followed for alteration of questions to query form for receiving a precise answer. This presentation analyzes diverse question answering systems that are based on semantic web technologies and ontologies with different formats of queries.It ends by addressing various reasoning alternatives.
Deriving an Emergent Relational Schema from RDF DataGraph-TA
This document discusses deriving an emergent relational schema from RDF data. It describes extracting characteristic sets from RDF data to recognize classes and relationships between classes. These characteristic sets are then merged and labeled to create a logical relational schema. This emergent schema provides benefits for both systems through improved efficiency and humans through easier query formulation over the RDF data. Key aspects of a useful emergent schema are discussed such as being compact, having human-friendly labels, providing high coverage of the RDF data, and being efficient to compute. Experimental results on real-world RDF datasets show the approach produces compact schemas with high coverage and understandable labels that improve performance over the native RDF representation.
MongoDB is a document-oriented database that bridges the gap between key-value stores and traditional relational databases. It uses collections of BSON documents (similar to JSON objects) rather than tables. Queries in MongoDB use JSON-like documents rather than SQL. MongoDB also supports features like embedded documents, dynamic schemas, rich queries and indexing to improve performance.
NoSQL databases were created to address the limitations of relational databases in handling big data. NoSQL databases are non-relational, schema-less, and provide better performance than relational databases by sacrificing features like joins, complex transactions and validation constraints. Common types of NoSQL databases include key-value stores, document stores, and tabular databases. MongoDB is an example of a popular document store database that stores data in JSON-like documents rather than in tables.
The most massive crime of identity theft in history was perpetrated in 2007 by exploiting an SQL Injection vulnerability. This issue is one of the most common and most serious threats to web application security. In this presentation, you'll see some common myths busted and you'll get a better understanding of defending against SQL injection.
The document discusses normalization in database design. Normalization is the process of organizing data to avoid redundancy and dependency. It involves splitting tables and restructuring relationships between tables. The document outlines various normal forms including 1NF, 2NF, 3NF, BCNF, 4NF and 5NF and provides examples to illustrate how to normalize tables to conform to each form.
The document outlines a 7-step process for mapping an entity-relationship (ER) schema to a relational database schema. The steps include mapping regular and weak entity types, binary 1:1, 1:N, and M:N relationship types, multivalued attributes, and n-ary relationship types to tables. For each type of schema element, the document describes how to represent it as a table with primary keys and foreign key attributes that preserve the relationships in the original ER schema.
ER DIAGRAM TO RELATIONAL SCHEMA MAPPING ARADHYAYANA
1) Entity types from ER diagrams are converted to tables, with attributes becoming columns and the entity's key becoming the primary key. Multi-valued attributes become separate tables linked by foreign keys.
2) Weak entities become tables with a composite primary key of the strong entity's primary key and the weak entity's key.
3) Relationships are represented by either adding foreign keys between tables or creating a separate table for many-to-many relationships containing foreign keys from the related tables.
The document describes an entity relationship (ER) diagram for a university database. The ER diagram models entities such as students, departments, courses, and sections. It also models attributes of these entities and relationships between entities such as students having a major department, courses being offered by departments, and students receiving grades in sections.
The document provides information about the course "Relational Database Management Systems" including its 5 units of study. Unit I provides an introduction to database concepts like data models, DBMS architecture, and Entity Relationship modeling. Unit II covers the relational model, SQL, queries, views, constraints, and database design. Unit III discusses transaction processing, concurrency control, and recovery concepts. Unit IV focuses on file operations, indexing techniques like B+ trees. Unit V examines special purpose databases for objects, XML, temporal, mobile and spatial data. The textbook and reference books are also listed.
This document discusses the similarities between data architecture and the Zachman Framework. The Zachman Framework is a matrix that describes an enterprise's information architecture, with the data column representing data architecture. Data architecture and each row of the Zachman Framework's data column correspond to different levels of data modeling, from a list of important business data to physical storage design. Both aim to define how data is stored, managed, and used within a system.
Improving the search mechanism for unstructured peer to-peer networks using t...Aditya Kumar
In a traditional file search mechanism, such as flooding, a peer broadcasts a query to its neighbours through an unstructured Peer-to-Peer (P2P) network until the Time-To-Live (TTL) decreases to zero.
The proposed method called the Statistical Matrix Form (SMF), which improves the flooding mechanism by selecting neighbors according to their capabilities.
00.00 fundamentals of database management syllabusBishal Ghimire
This document outlines the syllabus for a course on fundamentals of database management. It covers 10 units that include topics such as physical data storage, the relational model, database processing architectures, relational algebra and SQL, database design including normalization, database security, object-relational and distributed databases, data warehousing and mining, and transaction processing. Each unit provides an introduction to key concepts and topics to be covered.
M phil-computer-science-data-mining-projectsVijay Karan
This document provides summaries for several M.Phil Computer Science Data Mining Projects written in C#. The projects cover topics such as bridging virtual communities, mood recognition during online tests, surveying the size of the World Wide Web, knowledge sharing in virtual organizations, adaptive provisioning of human expertise in service-oriented systems, cost-aware rank joins with random and sorted access, improving data quality with dynamic forms, targeted data delivery algorithms, and sentiment classification using feature relation networks.
The document discusses establishing a data architecture to facilitate integration between different systems at UCLA for research administration. It recommends implementing a federated data services approach using a canonical data model to transform and present data from various source systems in a consistent way. This improves data access, allows for changing transactional systems more easily, and helps business logic be decoupled from source data structures for better reusability and longevity. Key considerations include defining the canonical data model, implementing transforms between source and canonical models, and serving normalized data through standards-based APIs.
This chapter discusses managing organizational data and information. It covers the traditional file environment and its problems, how databases provide a modern approach, database management systems, and logical data models including hierarchical, network and relational models. The key topics are data arrangement, traditional file problems like redundancy and inconsistency, how databases solve these with concepts like entities and relationships, data definition and manipulation languages, and the advantages of relational modeling.
Introduction to question answering for linked data & big dataAndre Freitas
This document discusses question answering (QA) systems in the context of big data and heterogeneous data scenarios. It outlines the motivation and challenges for developing natural language interfaces for databases. The document covers the basic concepts and taxonomy of QA systems, including question types, answer types, data sources, and domains. It also discusses the anatomy and components of a typical QA system.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
This document discusses the Linear Road benchmark for evaluating Stream Data Management Systems (SDMS). The benchmark simulates a toll system for a large metropolitan area that uses variable tolling based on real-time traffic and accident data. Linear Road was the first benchmark that allowed performance comparisons between SDMS and relational databases for processing high-volume streaming data. It addresses challenges like continuous queries and producing results in real-time by simulating a toll system that calculates fees dynamically based on streaming traffic information. Experiments found that a dedicated SDMS could outperform a relational database by at least a factor of five for this type of application.
QUALITY-AWARE SUBGRAPH MATCHING OVER INCONSISTENT PROBABILISTIC GRAPH DATABASESNexgen Technology
TO GET THIS PROJECT COMPLETE SOURCE ON SUPPORT WITH EXECUTION PLEASE CALL BELOW CONTACT DETAILS
MOBILE: 9791938249, 0413-2211159, WEB: WWW.NEXGENPROJECT.COM,WWW.FINALYEAR-IEEEPROJECTS.COM, EMAIL:Praveen@nexgenproject.com
NEXGEN TECHNOLOGY provides total software solutions to its customers. Apsys works closely with the customers to identify their business processes for computerization and help them implement state-of-the-art solutions. By identifying and enhancing their processes through information technology solutions. NEXGEN TECHNOLOGY help it customers optimally use their resources.
NoSQL databases were created to address the limitations of relational databases in handling big data. NoSQL databases are non-relational, schema-less, and provide better performance than relational databases by sacrificing features like joins, complex transactions and validation constraints. Common types of NoSQL databases include key-value stores, document stores, and tabular databases. MongoDB is an example of a popular document store database that stores data in JSON-like documents rather than in tables.
The most massive crime of identity theft in history was perpetrated in 2007 by exploiting an SQL Injection vulnerability. This issue is one of the most common and most serious threats to web application security. In this presentation, you'll see some common myths busted and you'll get a better understanding of defending against SQL injection.
The document discusses normalization in database design. Normalization is the process of organizing data to avoid redundancy and dependency. It involves splitting tables and restructuring relationships between tables. The document outlines various normal forms including 1NF, 2NF, 3NF, BCNF, 4NF and 5NF and provides examples to illustrate how to normalize tables to conform to each form.
The document outlines a 7-step process for mapping an entity-relationship (ER) schema to a relational database schema. The steps include mapping regular and weak entity types, binary 1:1, 1:N, and M:N relationship types, multivalued attributes, and n-ary relationship types to tables. For each type of schema element, the document describes how to represent it as a table with primary keys and foreign key attributes that preserve the relationships in the original ER schema.
ER DIAGRAM TO RELATIONAL SCHEMA MAPPING ARADHYAYANA
1) Entity types from ER diagrams are converted to tables, with attributes becoming columns and the entity's key becoming the primary key. Multi-valued attributes become separate tables linked by foreign keys.
2) Weak entities become tables with a composite primary key of the strong entity's primary key and the weak entity's key.
3) Relationships are represented by either adding foreign keys between tables or creating a separate table for many-to-many relationships containing foreign keys from the related tables.
The document describes an entity relationship (ER) diagram for a university database. The ER diagram models entities such as students, departments, courses, and sections. It also models attributes of these entities and relationships between entities such as students having a major department, courses being offered by departments, and students receiving grades in sections.
The document provides information about the course "Relational Database Management Systems" including its 5 units of study. Unit I provides an introduction to database concepts like data models, DBMS architecture, and Entity Relationship modeling. Unit II covers the relational model, SQL, queries, views, constraints, and database design. Unit III discusses transaction processing, concurrency control, and recovery concepts. Unit IV focuses on file operations, indexing techniques like B+ trees. Unit V examines special purpose databases for objects, XML, temporal, mobile and spatial data. The textbook and reference books are also listed.
This document discusses the similarities between data architecture and the Zachman Framework. The Zachman Framework is a matrix that describes an enterprise's information architecture, with the data column representing data architecture. Data architecture and each row of the Zachman Framework's data column correspond to different levels of data modeling, from a list of important business data to physical storage design. Both aim to define how data is stored, managed, and used within a system.
Improving the search mechanism for unstructured peer to-peer networks using t...Aditya Kumar
In a traditional file search mechanism, such as flooding, a peer broadcasts a query to its neighbours through an unstructured Peer-to-Peer (P2P) network until the Time-To-Live (TTL) decreases to zero.
The proposed method called the Statistical Matrix Form (SMF), which improves the flooding mechanism by selecting neighbors according to their capabilities.
00.00 fundamentals of database management syllabusBishal Ghimire
This document outlines the syllabus for a course on fundamentals of database management. It covers 10 units that include topics such as physical data storage, the relational model, database processing architectures, relational algebra and SQL, database design including normalization, database security, object-relational and distributed databases, data warehousing and mining, and transaction processing. Each unit provides an introduction to key concepts and topics to be covered.
M phil-computer-science-data-mining-projectsVijay Karan
This document provides summaries for several M.Phil Computer Science Data Mining Projects written in C#. The projects cover topics such as bridging virtual communities, mood recognition during online tests, surveying the size of the World Wide Web, knowledge sharing in virtual organizations, adaptive provisioning of human expertise in service-oriented systems, cost-aware rank joins with random and sorted access, improving data quality with dynamic forms, targeted data delivery algorithms, and sentiment classification using feature relation networks.
The document discusses establishing a data architecture to facilitate integration between different systems at UCLA for research administration. It recommends implementing a federated data services approach using a canonical data model to transform and present data from various source systems in a consistent way. This improves data access, allows for changing transactional systems more easily, and helps business logic be decoupled from source data structures for better reusability and longevity. Key considerations include defining the canonical data model, implementing transforms between source and canonical models, and serving normalized data through standards-based APIs.
This chapter discusses managing organizational data and information. It covers the traditional file environment and its problems, how databases provide a modern approach, database management systems, and logical data models including hierarchical, network and relational models. The key topics are data arrangement, traditional file problems like redundancy and inconsistency, how databases solve these with concepts like entities and relationships, data definition and manipulation languages, and the advantages of relational modeling.
Introduction to question answering for linked data & big dataAndre Freitas
This document discusses question answering (QA) systems in the context of big data and heterogeneous data scenarios. It outlines the motivation and challenges for developing natural language interfaces for databases. The document covers the basic concepts and taxonomy of QA systems, including question types, answer types, data sources, and domains. It also discusses the anatomy and components of a typical QA system.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
This document discusses the Linear Road benchmark for evaluating Stream Data Management Systems (SDMS). The benchmark simulates a toll system for a large metropolitan area that uses variable tolling based on real-time traffic and accident data. Linear Road was the first benchmark that allowed performance comparisons between SDMS and relational databases for processing high-volume streaming data. It addresses challenges like continuous queries and producing results in real-time by simulating a toll system that calculates fees dynamically based on streaming traffic information. Experiments found that a dedicated SDMS could outperform a relational database by at least a factor of five for this type of application.
QUALITY-AWARE SUBGRAPH MATCHING OVER INCONSISTENT PROBABILISTIC GRAPH DATABASESNexgen Technology
TO GET THIS PROJECT COMPLETE SOURCE ON SUPPORT WITH EXECUTION PLEASE CALL BELOW CONTACT DETAILS
MOBILE: 9791938249, 0413-2211159, WEB: WWW.NEXGENPROJECT.COM,WWW.FINALYEAR-IEEEPROJECTS.COM, EMAIL:Praveen@nexgenproject.com
NEXGEN TECHNOLOGY provides total software solutions to its customers. Apsys works closely with the customers to identify their business processes for computerization and help them implement state-of-the-art solutions. By identifying and enhancing their processes through information technology solutions. NEXGEN TECHNOLOGY help it customers optimally use their resources.
This document provides an overview of data modeling concepts. It discusses the importance of data modeling, the basic building blocks of data models including entities, attributes, and relationships. It also covers different types of data models such as conceptual, logical, and physical models. The document discusses relational and non-relational data models as well as emerging models like object-oriented, XML, and big data models. Business rules and their role in database design are also summarized.
This document summarizes research on techniques for improving database performance under heavy query loads. It discusses using fuzzy logic to classify queries by priority and batch similar queries to execute together. The document reviews related work on detecting misuse and insider threats, collaborative querying, risk-adaptive access control models, query recommendation, and ranking query results. The proposed approach uses fuzzy logic to identify high priority queries in a priority queue based on extracted features. Queries are clustered and batched by type to commit together, aiming to yield the best database performance even under high loads.
This document summarizes a capstone project on automated data science. It discusses the data science pipeline, which includes preparation, analysis, and integration phases. Activities within the preparation phase like data cleansing, dimension reduction, correlation analysis, and feature synthesis have varying levels of automation maturity. Algorithms and techniques for automating tasks in each phase are presented. The document also examines challenges of incorporating automated data science like change management and skills transition. Finally, it discusses vendor capabilities in different phases and factors to consider for in-house vs outsourced integration solutions.
This document discusses techniques for detecting duplicate records from multiple web databases. It begins with an abstract describing an unsupervised approach that uses classifiers like the weighted component similarity summing classifier and support vector machine along with a Gaussian mixture model to iteratively identify duplicate records. The document then provides details on related work, including probabilistic matching models, supervised and unsupervised learning techniques, distance-based techniques, rule-based approaches, and methods for improving efficiency like blocking and the sorted neighborhood approach.
Our research demonstrates how data assimilation can be used, with a non-hydrostatic coastal ocean model, to study sub-mesoscale processes and accurately estimate the state variables. The implementation is non trivial for physical ocean models which are highly nonlinear, sensitive to perturbations, and require a dense spatial discretization in order to correctly reproduce the dynamics. A major challenge of this approach is the high computational cost incurred by a high-resolution numerical model with a three-dimensional data assimilation scheme in a complicated stratified system. Interfacing the General Curvilinear Coastal Ocean Model (GCCOM) with the faster data assimilation framework, NCAR Data Assimilation Research Testbed (DART), allowed us to assimilate very high resolution observations into the system. Observing System Simulation Experiments (OSSEs) in very steep seamount test cases are presented. These were used to explore the proper initial ensemble members for the model, estimate the observation error variance needed to reproduce the dynamics in a turbulent flow experiment, and to analyze the impact of localization in such small processes. Our results demonstrate that the DART-GCCOM model can assimilate high resolution observations (tenths of meters) using as few as 30 ensemble members.
Similar to Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems (20)
Transform Your Communication with Cloud-Based IVR SolutionsTheSMSPoint
Discover the power of Cloud-Based IVR Solutions to streamline communication processes. Embrace scalability and cost-efficiency while enhancing customer experiences with features like automated call routing and voice recognition. Accessible from anywhere, these solutions integrate seamlessly with existing systems, providing real-time analytics for continuous improvement. Revolutionize your communication strategy today with Cloud-Based IVR Solutions. Learn more at: https://thesmspoint.com/channel/cloud-telephony
A Study of Variable-Role-based Feature Enrichment in Neural Models of CodeAftab Hussain
Understanding variable roles in code has been found to be helpful by students
in learning programming -- could variable roles help deep neural models in
performing coding tasks? We do an exploratory study.
- These are slides of the talk given at InteNSE'23: The 1st International Workshop on Interpretability and Robustness in Neural Software Engineering, co-located with the 45th International Conference on Software Engineering, ICSE 2023, Melbourne Australia
Most important New features of Oracle 23c for DBAs and Developers. You can get more idea from my youtube channel video from https://youtu.be/XvL5WtaC20A
E-commerce Development Services- Hornet DynamicsHornet Dynamics
For any business hoping to succeed in the digital age, having a strong online presence is crucial. We offer Ecommerce Development Services that are customized according to your business requirements and client preferences, enabling you to create a dynamic, safe, and user-friendly online store.
Neo4j - Product Vision and Knowledge Graphs - GraphSummit ParisNeo4j
Dr. Jesús Barrasa, Head of Solutions Architecture for EMEA, Neo4j
Découvrez les dernières innovations de Neo4j, et notamment les dernières intégrations cloud et les améliorations produits qui font de Neo4j un choix essentiel pour les développeurs qui créent des applications avec des données interconnectées et de l’IA générative.
SOCRadar's Aviation Industry Q1 Incident Report is out now!
The aviation industry has always been a prime target for cybercriminals due to its critical infrastructure and high stakes. In the first quarter of 2024, the sector faced an alarming surge in cybersecurity threats, revealing its vulnerabilities and the relentless sophistication of cyber attackers.
SOCRadar’s Aviation Industry, Quarterly Incident Report, provides an in-depth analysis of these threats, detected and examined through our extensive monitoring of hacker forums, Telegram channels, and dark web platforms.
Using Query Store in Azure PostgreSQL to Understand Query PerformanceGrant Fritchey
Microsoft has added an excellent new extension in PostgreSQL on their Azure Platform. This session, presented at Posette 2024, covers what Query Store is and the types of information you can get out of it.
Everything You Need to Know About X-Sign: The eSign Functionality of XfilesPr...XfilesPro
Wondering how X-Sign gained popularity in a quick time span? This eSign functionality of XfilesPro DocuPrime has many advancements to offer for Salesforce users. Explore them now!
Measures in SQL (SIGMOD 2024, Santiago, Chile)Julian Hyde
SQL has attained widespread adoption, but Business Intelligence tools still use their own higher level languages based upon a multidimensional paradigm. Composable calculations are what is missing from SQL, and we propose a new kind of column, called a measure, that attaches a calculation to a table. Like regular tables, tables with measures are composable and closed when used in queries.
SQL-with-measures has the power, conciseness and reusability of multidimensional languages but retains SQL semantics. Measure invocations can be expanded in place to simple, clear SQL.
To define the evaluation semantics for measures, we introduce context-sensitive expressions (a way to evaluate multidimensional expressions that is consistent with existing SQL semantics), a concept called evaluation context, and several operations for setting and modifying the evaluation context.
A talk at SIGMOD, June 9–15, 2024, Santiago, Chile
Authors: Julian Hyde (Google) and John Fremlin (Google)
https://doi.org/10.1145/3626246.3653374
E-Invoicing Implementation: A Step-by-Step Guide for Saudi Arabian CompaniesQuickdice ERP
Explore the seamless transition to e-invoicing with this comprehensive guide tailored for Saudi Arabian businesses. Navigate the process effortlessly with step-by-step instructions designed to streamline implementation and enhance efficiency.
Atelier - Innover avec l’IA Générative et les graphes de connaissancesNeo4j
Atelier - Innover avec l’IA Générative et les graphes de connaissances
Allez au-delà du battage médiatique autour de l’IA et découvrez des techniques pratiques pour utiliser l’IA de manière responsable à travers les données de votre organisation. Explorez comment utiliser les graphes de connaissances pour augmenter la précision, la transparence et la capacité d’explication dans les systèmes d’IA générative. Vous partirez avec une expérience pratique combinant les relations entre les données et les LLM pour apporter du contexte spécifique à votre domaine et améliorer votre raisonnement.
Amenez votre ordinateur portable et nous vous guiderons sur la mise en place de votre propre pile d’IA générative, en vous fournissant des exemples pratiques et codés pour démarrer en quelques minutes.
Microservice Teams - How the cloud changes the way we workSven Peters
A lot of technical challenges and complexity come with building a cloud-native and distributed architecture. The way we develop backend software has fundamentally changed in the last ten years. Managing a microservices architecture demands a lot of us to ensure observability and operational resiliency. But did you also change the way you run your development teams?
Sven will talk about Atlassian’s journey from a monolith to a multi-tenanted architecture and how it affected the way the engineering teams work. You will learn how we shifted to service ownership, moved to more autonomous teams (and its challenges), and established platform and enablement teams.
Do you want Software for your Business? Visit Deuglo
Deuglo has top Software Developers in India. They are experts in software development and help design and create custom Software solutions.
Deuglo follows seven steps methods for delivering their services to their customers. They called it the Software development life cycle process (SDLC).
Requirement — Collecting the Requirements is the first Phase in the SSLC process.
Feasibility Study — after completing the requirement process they move to the design phase.
Design — in this phase, they start designing the software.
Coding — when designing is completed, the developers start coding for the software.
Testing — in this phase when the coding of the software is done the testing team will start testing.
Installation — after completion of testing, the application opens to the live server and launches!
Maintenance — after completing the software development, customers start using the software.
Artificia Intellicence and XPath Extension FunctionsOctavian Nadolu
The purpose of this presentation is to provide an overview of how you can use AI from XSLT, XQuery, Schematron, or XML Refactoring operations, the potential benefits of using AI, and some of the challenges we face.
Oracle Database 19c New Features for DBAs and Developers.pptx
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
1. Search-Based Testing of Relational Schema
Integrity Constraints Across Multiple
Database Management Systems
Gregory M. Kapfhammer1 & Phil McMinn2 & Chris J. Wright2
1Allegheny College, USA
2University of Sheffield, UK
Sixth IEEE International Conference on Software Testing,
Verification and Validation (ICST 2013)
Tuesday, March 19, 2013
2. Introduction Testing Technique Empirical Study Conclusion
Motivation
Databases Are Everywhere!
Relational
Database
Management
Systems
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
3. Introduction Testing Technique Empirical Study Conclusion
Motivation
Databases Are Everywhere!
Relational
Database
Management
Systems
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
4. Introduction Testing Technique Empirical Study Conclusion
Motivation
Databases Are Everywhere!
Deployment Locations for Databases
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
5. Introduction Testing Technique Empirical Study Conclusion
Motivation
Databases Are Everywhere!
Deployment Locations for Databases
Database
Application
Server
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
6. Introduction Testing Technique Empirical Study Conclusion
Motivation
Databases Are Everywhere!
Deployment Locations for Databases
Database
Application
Server
Mobile Phone
or Tablet
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
7. Introduction Testing Technique Empirical Study Conclusion
Motivation
Databases Are Everywhere!
Deployment Locations for Databases
Database
Application
Server
Mobile Phone
or Tablet
Office and
Productivity
Software
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
8. Introduction Testing Technique Empirical Study Conclusion
Motivation
Databases Are Everywhere!
Deployment Locations for Databases
Database
Application
Server
Mobile Phone
or Tablet
Office and
Productivity
Software
Government
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
9. Introduction Testing Technique Empirical Study Conclusion
Motivation
Databases Are Everywhere!
Deployment Locations for Databases
Database
Application
Server
Mobile Phone
or Tablet
Office and
Productivity
Software
Government Astrophysics
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
10. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
11. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
12. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
13. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
14. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema StateSchema
Integrity Constraints
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
15. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema StateSchema
Integrity Constraints
PRIMARY KEY
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
16. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema StateSchema
Integrity Constraints
PRIMARY KEY FOREIGN KEY
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
17. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema StateSchema
Integrity Constraints
PRIMARY KEY FOREIGN KEY Arbitrary CHECK
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
18. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema StateState
Relational Components
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
19. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema StateState
Relational Components
Tables
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
20. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema StateState
Relational Components
Tables Rows
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
21. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema StateState
Relational Components
Tables Rows Columns
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
22. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working Correctly
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
23. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working Correctly
INSERT
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
24. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working Correctly
INSERT
Schema
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
25. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working Correctly
INSERT
Schema State
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
26. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working Correctly
INSERT
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
27. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working Correctly
Schema
INSERT
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
28. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working Correctly
Schema
INSERT
State
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
29. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working CorrectlyThe Relational Schema is Not Working Correctly
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
30. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working CorrectlyThe Relational Schema is Not Working Correctly
INSERT
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
31. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working CorrectlyThe Relational Schema is Not Working Correctly
INSERT
Schema
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
32. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working CorrectlyThe Relational Schema is Not Working Correctly
INSERT
Schema State
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
33. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working CorrectlyThe Relational Schema is Not Working Correctly
INSERT
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
34. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working CorrectlyThe Relational Schema is Not Working Correctly
INSERT
Schema
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
35. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working CorrectlyThe Relational Schema is Not Working Correctly
INSERT
Schema State
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
36. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working CorrectlyThe Relational Schema is Not Working Correctly
Schema State
SELECT
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
37. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working CorrectlyThe Relational Schema is Not Working Correctly
Schema State
SELECT SELECT
RESULT
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
38. Introduction Testing Technique Empirical Study Conclusion
Challenges
Relational Database Schema
Relational Database
Management System
E-commerce
Schema State
The Relational Schema is Working CorrectlyThe Relational Schema is Not Working Correctly
Schema State
SELECT SELECT
RESULT
Not working correctly!
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
39. Introduction Testing Technique Empirical Study Conclusion
Challenges
Need for Relational Schema Testing
The Data Warehouse Institute reports that
North American organizations experience a
$611 billion annual loss due to poor data quality
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
40. Introduction Testing Technique Empirical Study Conclusion
Challenges
Need for Relational Schema Testing
The Data Warehouse Institute reports that
North American organizations experience a
$611 billion annual loss due to poor data quality
Scott W. Ambler argues that the “virtual
absence” of database testing — the validation of
the contents, schema, and functionality of the
database — is the primary cause of this loss
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
41. Introduction Testing Technique Empirical Study Conclusion
Challenges
Need for Relational Schema Testing
The Data Warehouse Institute reports that
North American organizations experience a
$611 billion annual loss due to poor data quality
Scott W. Ambler argues that the “virtual
absence” of database testing — the validation of
the contents, schema, and functionality of the
database — is the primary cause of this loss
This paper presents SchemaAnalyst, a
search-based system for testing the complex
integrity constraints in relational schemas
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
42. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
43. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
The highlighted integrity constraints determine what data is valid
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
44. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
The highlighted integrity constraints determine what data is valid
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
45. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
The highlighted integrity constraints determine what data is valid
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
46. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
The highlighted integrity constraints determine what data is valid
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
47. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
The highlighted integrity constraints determine what data is valid
CREATE TABLE FlightAvailable (
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
FLIGHT DATE DATE NOT NULL,
ECONOMY SEATS TAKEN INT,
BUSINESS SEATS TAKEN INT,
FIRSTCLASS SEATS TAKEN INT,
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
FOREIGN KEY(FLIGHT ID, SEGMENT NUMBER)
REFERENCES Flights(FLIGHT ID, SEGMENT NUMBER)
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
48. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
The highlighted integrity constraints determine what data is valid
CREATE TABLE FlightAvailable (
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
FLIGHT DATE DATE NOT NULL,
ECONOMY SEATS TAKEN INT,
BUSINESS SEATS TAKEN INT,
FIRSTCLASS SEATS TAKEN INT,
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
FOREIGN KEY(FLIGHT ID, SEGMENT NUMBER)
REFERENCES Flights(FLIGHT ID, SEGMENT NUMBER)
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
49. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
The highlighted integrity constraints determine what data is valid
CREATE TABLE FlightAvailable (
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
FLIGHT DATE DATE NOT NULL,
ECONOMY SEATS TAKEN INT,
BUSINESS SEATS TAKEN INT,
FIRSTCLASS SEATS TAKEN INT,
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
FOREIGN KEY(FLIGHT ID, SEGMENT NUMBER)
REFERENCES Flights(FLIGHT ID, SEGMENT NUMBER)
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
50. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
The highlighted integrity constraints determine what data is valid
CREATE TABLE FlightAvailable (
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
FLIGHT DATE DATE NOT NULL,
ECONOMY SEATS TAKEN INT,
BUSINESS SEATS TAKEN INT,
FIRSTCLASS SEATS TAKEN INT,
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
FOREIGN KEY(FLIGHT ID, SEGMENT NUMBER)
REFERENCES Flights(FLIGHT ID, SEGMENT NUMBER)
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
51. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
Defect: The schema does not contain the correct primary key!
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
52. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
Defect: The schema does not contain the correct primary key!
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
53. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
Defect: The schema does not contain the correct primary key!
CREATE TABLE FlightAvailable (
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
FLIGHT DATE DATE NOT NULL,
ECONOMY SEATS TAKEN INT,
BUSINESS SEATS TAKEN INT,
FIRSTCLASS SEATS TAKEN INT,
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
FOREIGN KEY(FLIGHT ID, SEGMENT NUMBER)
REFERENCES Flights(FLIGHT ID, SEGMENT NUMBER)
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
54. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
CREATE TABLE FlightAvailable (
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
FLIGHT DATE DATE NOT NULL,
ECONOMY SEATS TAKEN INT,
BUSINESS SEATS TAKEN INT,
FIRSTCLASS SEATS TAKEN INT,
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
FOREIGN KEY(FLIGHT ID, SEGMENT NUMBER)
REFERENCES Flights(FLIGHT ID, SEGMENT NUMBER)
);
Question: What kind of INSERT(s) will reveal this defect?
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
55. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
Question: What kind of INSERT(s) will reveal this defect?
INSERT INTO Flights
VALUES(’UA20’, 1, ... )
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
56. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
Question: What kind of INSERT(s) will reveal this defect?
INSERT INTO Flights
VALUES(’UA20’, 1, ... )
INSERT INTO Flights
VALUES(’UA20’, 2, ... )
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
57. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
Question: What kind of INSERT(s) will reveal this defect?
INSERT INTO Flights
VALUES(’UA20’, 1, ... )
INSERT INTO Flights
VALUES(’UA20’, 2, ... )
Explanation: A flight with two different segments is no longer allowed!
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
58. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Defects in Relational Schemas
Question: What kind of INSERT(s) will reveal this defect?
INSERT INTO Flights
VALUES(’UA20’, 1, ... )
INSERT INTO Flights
VALUES(’UA20’, 2, ... )
Explanation: A flight with two different segments is no longer allowed!
SchemaAnalyst automatically generates these INSERTs and this data!
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
59. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Search-Based Testing with SchemaAnalyst
Schema
Representation
Generator
Test Suite
Generator
Mutation
Analysis
Test Suites
Mutants
and
Scores
Test suites
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
60. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Search-Based Testing with SchemaAnalyst
Schema
Representation
Generator
Test Suite
Generator
Mutation
Analysis
Test Suites
Mutants
and
Scores
Test suites
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
61. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Search-Based Testing with SchemaAnalyst
Schema
Representation
Generator
Test Suite
Generator
Mutation
Analysis
Test Suites
Mutants
and
Scores
Test suites
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
62. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Search-Based Testing with SchemaAnalyst
Schema
Representation
Generator
Test Suite
Generator
Mutation
Analysis
Test Suites
Mutants
and
Scores
Test suites
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
63. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Goals and Stages of Test Data Generation
Goal of test data generation?
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
64. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Goals and Stages of Test Data Generation
Goal of test data generation?
INSERT INTO T1 VALUES(1, Jan-08-99, ... )
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
65. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Goals and Stages of Test Data Generation
Goal of test data generation?
INSERT INTO T1 VALUES(1, Jan-08-99, ... )
INSERT INTO T1 VALUES(1, Jan-08-99, ... )
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
66. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Goals and Stages of Test Data Generation
Goal of test data generation?
INSERT INTO T1 VALUES(1, Jan-08-99, ... )
INSERT INTO T1 VALUES(1, Jan-08-99, ... )
INSERT INTO Tn VALUES(true, ’L-20’, ... )
INSERT INTO Tn VALUES(false, ’L-1’, ... )
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
67. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Goals and Stages of Test Data Generation
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
68. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Goals and Stages of Test Data Generation
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Stage 1: Generate rows of data to satisfy the integrity constraints
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
69. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Goals and Stages of Test Data Generation
Stage 1: Generate rows of data to satisfy the integrity constraints
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
70. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Goals and Stages of Test Data Generation
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
71. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Goals and Stages of Test Data Generation
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Stage 2: Generate rows of data to negate a constraint
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
72. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Goals and Stages of Test Data Generation
Stage 2: Generate rows of data to negate a constraint
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
73. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Goals and Stages of Test Data Generation
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
A fitness function computes a numeric value minimized by search
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
74. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Goals and Stages of Test Data Generation
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Data’s fitness is closer to zero when nearer to a primary key value
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
75. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Goals and Stages of Test Data Generation
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Types, primary and foreign keys, UNIQUE, NOT NULL, and CHECK
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
76. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Goals and Stages of Test Data Generation
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
See the paper for more details about the computation of fitness
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
77. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
78. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
79. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
80. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use the defaults to form the initial values of the INSERT variables
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
81. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use exploratory moves to determine the correct direction for search
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
82. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use exploratory moves to determine the correct direction for search
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
83. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use exploratory moves to determine the correct direction for search
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
84. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use exploratory moves to determine the correct direction for search
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
85. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use exploratory moves to determine the correct direction for search
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
86. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use exploratory moves to determine the correct direction for search
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
87. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use pattern moves to accelerate the improvements in fitness
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
88. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use pattern moves to accelerate the improvements in fitness
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
89. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use pattern moves to accelerate the improvements in fitness
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
90. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use pattern moves to accelerate the improvements in fitness
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
91. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use pattern moves to accelerate the improvements in fitness
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
92. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use pattern moves to accelerate the improvements in fitness
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
93. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use pattern moves to accelerate the improvements in fitness
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
94. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use pattern moves to accelerate the improvements in fitness
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
95. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use pattern moves to accelerate the improvements in fitnessAVM terminates when the fitness is zero or an exploration cycle fails
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
96. Introduction Testing Technique Empirical Study Conclusion
Test Data Generation
Alternating Variable Method
Vi
Vj
Vk
Use pattern moves to accelerate the improvements in fitnessAVM terminates when the fitness is zero or an exploration cycle failsRestart AVM with random column values when an exploration cycle fails
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
97. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
98. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Use mutation analysis to assess the adequacy of INSERTs and values
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
99. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Primary Keys: Remove, replace, and add column operators
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
100. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
Primary Keys: Remove, replace, and add column operators
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
101. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
Primary Keys: Remove, replace, and add column operators
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
102. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
Primary Keys: Remove, replace, and add column operators
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(ORIGINAL AIRPORT, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
103. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
Primary Keys: Remove, replace, and add column operators
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
104. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
Primary Keys: Remove, replace, and add column operators
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER, DEST AIRPORT),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
105. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
UNIQUE: Handle in a fashion similar to the primary key operator
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
106. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
NOT NULL: Reverse the status for all non-primary key columns
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
107. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
NOT NULL: Reverse the status for all non-primary key columns
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
108. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
NOT NULL: Reverse the status for all non-primary key columns
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3) NOT NULL,
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
109. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
CHECK: Remove the constraint for each of the checked columns
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
110. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
CHECK: Remove the constraint for each of the checked columns
CREATE TABLE Flights(
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
ORIGINAL AIRPORT CHAR(3),
DEPART TIME TIME,
DEST AIRPORT CHAR(3),
ARRIVE TIME TIME,
MEAL CHAR(1),
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
CHECK(MEAL IN (’B’, ’L’, ’D’, ’S’))
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
111. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
CREATE TABLE FlightAvailable (
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
FLIGHT DATE DATE NOT NULL,
ECONOMY SEATS TAKEN INT,
BUSINESS SEATS TAKEN INT,
FIRSTCLASS SEATS TAKEN INT,
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
FOREIGN KEY(FLIGHT ID, SEGMENT NUMBER)
REFERENCES Flights(FLIGHT ID, SEGMENT NUMBER)
);
Foreign Keys: Remove each column from the key
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
112. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
Foreign Keys: Remove each column from the key
CREATE TABLE FlightAvailable (
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
FLIGHT DATE DATE NOT NULL,
ECONOMY SEATS TAKEN INT,
BUSINESS SEATS TAKEN INT,
FIRSTCLASS SEATS TAKEN INT,
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
FOREIGN KEY(FLIGHT ID, SEGMENT NUMBER)
REFERENCES Flights(FLIGHT ID, SEGMENT NUMBER)
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
113. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Mutation Operators for Schemas
Foreign Keys: Remove each column from the key
CREATE TABLE FlightAvailable (
FLIGHT ID CHAR(6) NOT NULL,
SEGMENT NUMBER INT NOT NULL,
FLIGHT DATE DATE NOT NULL,
ECONOMY SEATS TAKEN INT,
BUSINESS SEATS TAKEN INT,
FIRSTCLASS SEATS TAKEN INT,
PRIMARY KEY(FLIGHT ID, SEGMENT NUMBER),
FOREIGN KEY(FLIGHT ID, SEGMENT NUMBER)
REFERENCES Flights(FLIGHT ID, SEGMENT NUMBER)
);
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
114. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Calculating the Mutation Score
MD =
|K ∪ Q|
|K ∪ N|
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
115. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Calculating the Mutation Score
MD =
|K ∪ Q|
|K ∪ N|
MD =
|K ∪ Q|
|K ∪ N|
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
116. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Calculating the Mutation Score
MD =
|K ∪ Q|
|K ∪ N|
MD =
|K ∪ Q|
|K ∪ N|
MD =
|K ∪ Q|
|K ∪ N|
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
117. Introduction Testing Technique Empirical Study Conclusion
Relational Schema Mutation
Calculating the Mutation Score
MD =
|K ∪ Q|
|K ∪ N|
MD =
|K ∪ Q|
|K ∪ N|
MD =
|K ∪ Q|
|K ∪ N|
MD =
|K ∪ Q|
|K ∪ N|
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
139. Introduction Testing Technique Empirical Study Conclusion
Configuration
Case Study Schemas
Tables
Columns
Checks
Foreignkeys
NotNulls
Primarykeys
Uniques
TotalConstraints
Totals 111 542 27 40 231 68 11 377
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
140. Introduction Testing Technique Empirical Study Conclusion
Configuration
Data Generation Techniques
DBMonster
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
141. Introduction Testing Technique Empirical Study Conclusion
Configuration
Data Generation Techniques
DBMonster SchemaAnalyst
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
142. Introduction Testing Technique Empirical Study Conclusion
Configuration
Data Generation Techniques
DBMonster SchemaAnalyst
HSQLDB
SQLite
Postgres
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
143. Introduction Testing Technique Empirical Study Conclusion
Configuration
Data Generation Techniques
DBMonster SchemaAnalyst
HSQLDB
SQLite
Postgres
HSQLDB
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
144. Introduction Testing Technique Empirical Study Conclusion
Configuration
Data Generation Techniques
DBMonster SchemaAnalyst
HSQLDB
SQLite
Postgres
HSQLDB
SQLite
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
145. Introduction Testing Technique Empirical Study Conclusion
Configuration
Data Generation Techniques
DBMonster SchemaAnalyst
HSQLDB
SQLite
Postgres
HSQLDB
SQLite
Postgres
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
146. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Constraint Coverage Results
Schema AVM (%) DBMonster (%)
Flights 100.0 70.0
FrenchTowns 100.0 70.0
Inventory 100.0 75.0
Iso3166 100.0 50.0
JWhoisServer 100.0 50.0
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
147. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Constraint Coverage Results
Schema AVM (%) DBMonster (%)
Flights 100.0 70.0
FrenchTowns 100.0 70.0
Inventory 100.0 75.0
Iso3166 100.0 50.0
JWhoisServer 100.0 50.0
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
148. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Constraint Coverage Results
Schema AVM (%) DBMonster (%)
NistDML181 100.0 75.0
NistDML182 100.0 50.0
NistDML183 100.0 100.0
NistXTS748 100.0 72.2
NistXTS749 100.0 21.4
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
149. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Constraint Coverage Results
Schema AVM (%) DBMonster (%)
NistDML181 100.0 75.0
NistDML182 100.0 50.0
NistDML183 100.0 100.0
NistXTS748 100.0 72.2
NistXTS749 100.0 21.4
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
150. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Constraint Coverage Results
Schema AVM (%) DBMonster (%)
NistDML181 100.0 75.0
NistDML182 100.0 50.0
NistDML183 100.0 100.0
NistXTS748 100.0 72.2
NistXTS749 100.0 21.4
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
151. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Constraint Coverage Results
Schema AVM (%) DBMonster (%)
Residence 100.0 62.5
RiskIt 100.0 4.1
Products 96.4 59.3
UnixUsage 97.8 59.3
Usda 100.0 50.0
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
152. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Constraint Coverage Results
Schema AVM (%) DBMonster (%)
Residence 100.0 62.5
RiskIt 100.0 4.1
Products 96.4 59.3
UnixUsage 97.8 59.3
Usda 100.0 50.0
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
153. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Constraint Coverage Results
Schema AVM (%) DBMonster (%)
Residence 100.0 62.5
RiskIt 100.0 4.1
Products 96.4 59.3
UnixUsage 97.8 59.3
Usda 100.0 50.0
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
154. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Constraint Coverage Results
Schema AVM (%) DBMonster (%)
Residence 100.0 62.5
RiskIt 100.0 4.1
Products 96.4 59.3
UnixUsage 97.8 59.3
Usda 100.0 50.0
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
155. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Quasi-Mutant Results
Number of Mutants
Hsqldb
Postgres
SQLite
0 20 40 60 80 100 120
CustomerOrder
Non−Quasi Quasi
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
156. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Quasi-Mutant Results
Number of Mutants
Hsqldb
Postgres
SQLite
0 50 100 150
JWhoisServer
Non−Quasi Quasi
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
157. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Quasi-Mutant Results
Number of Mutants
Hsqldb
Postgres
SQLite
0 50 100 150
DellStore
Non−Quasi Quasi
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
158. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Summary: Quasi-Mutant Results
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
159. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Summary: Quasi-Mutant Results
None SomeSome
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
160. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Summary: Quasi-Mutant Results
None SomeSome
Few quasi-mutants means that the mutation
scores are good effectiveness indicators
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
161. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Mutation Score Results
DBMonster SchemaAnalyst
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
162. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Mutation Score Results
DBMonster SchemaAnalyst
JWhoisServer DBI=62, MD = 0.7DBI=300, MD = 0.2
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
163. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Mutation Score Results
DBMonster SchemaAnalyst
JWhoisServer DBI=62, MD = 0.7DBI=300, MD = 0.2
NistDML181 DBI=7, MD = 0.6DBI=13,650, MD = 0.5
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
164. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Mutation Score Results
DBMonster SchemaAnalyst
(0.29, 0.59, 0.65, 0.70, 0.89)
(0.0, 0.11, 0.41, 0.52, 0.68)
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
165. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Mutation Score Results
DBMonster SchemaAnalyst
(0.29, 0.59, 0.65, 0.70, 0.89)
(0.0, 0.11, 0.41, 0.52, 0.68)
DBMonster crashes
for six schemas!
CustomerOrder
Flights
NistDML182
NistXTS748
Person
RiskIt
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
166. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Mutation Score Results
DBMonster SchemaAnalyst
(0.29, 0.59, 0.65, 0.70, 0.89)
(0.0, 0.11, 0.41, 0.52, 0.68)
DBMonster crashes
for six schemas!
CustomerOrder
Flights
NistDML182
NistXTS748
Person
RiskIt
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
167. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Mutation Score Results
DBMonster SchemaAnalyst
(0.29, 0.59, 0.65, 0.70, 0.89)
(0.0, 0.11, 0.41, 0.52, 0.68)
DBMonster crashes
for six schemas!
CustomerOrder
Flights
NistDML182
NistXTS748
Person
RiskIt
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
168. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Mutation Score Results
DBMonster SchemaAnalyst
(0.29, 0.59, 0.65, 0.70, 0.89)
(0.0, 0.11, 0.41, 0.52, 0.68)
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
169. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Mutation Score Results
DBMonster SchemaAnalyst
(0.29, 0.59, 0.65, 0.70, 0.89)
(0.0, 0.11, 0.41, 0.52, 0.68)
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
170. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Mutation Score Results
DBMonster SchemaAnalyst
SchemaAnalyst’s
mutation score is
higher than DB-
Monster’s for 96%
of the schemas
(0.29, 0.59, 0.65, 0.70, 0.89)
(0.0, 0.11, 0.41, 0.52, 0.68)
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
171. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Efficiency Results
DBMonster SchemaAnalyst
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
172. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Efficiency Results
DBMonster SchemaAnalyst
(0.41, 1.09, 1.90, 5.07, 36.52)
(1.50, 3.01, 5.21, 16.79, 639.93)
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
173. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Efficiency Results
DBMonster SchemaAnalyst
(0.41, 1.09, 1.90, 5.07, 36.52)
(1.50, 3.01, 5.21, 16.79, 639.93)
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
174. Introduction Testing Technique Empirical Study Conclusion
Results Analysis
Efficiency Results
DBMonster SchemaAnalyst
(0.41, 1.09, 1.90, 5.07, 36.52)
(1.50, 3.01, 5.21, 16.79, 639.93)
SchemaAnalyst
exhibits competi-
tive data genera-
tion times that are
less variable
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
175. Introduction Testing Technique Empirical Study Conclusion
Summary
Important Contributions
This paper presents SchemaAnalyst, a
search-based system for testing the complex
integrity constraints in relational schemas
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
176. Introduction Testing Technique Empirical Study Conclusion
Summary
Important Contributions
This paper presents SchemaAnalyst, a
search-based system for testing the complex
integrity constraints in relational schemas
The empirical study demonstrates that Schema-
Analyst’s efficiency is competitive with DBMonster’s
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
177. Introduction Testing Technique Empirical Study Conclusion
Summary
Important Contributions
This paper presents SchemaAnalyst, a
search-based system for testing the complex
integrity constraints in relational schemas
The empirical study demonstrates that Schema-
Analyst’s efficiency is competitive with DBMonster’s
SchemaAnalyst almost always covers 100% of the
constraints in the 25 chosen relational schemas
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
178. Introduction Testing Technique Empirical Study Conclusion
Summary
Important Contributions
This paper presents SchemaAnalyst, a
search-based system for testing the complex
integrity constraints in relational schemas
The empirical study demonstrates that Schema-
Analyst’s efficiency is competitive with DBMonster’s
SchemaAnalyst almost always covers 100% of the
constraints in the 25 chosen relational schemas
SchemaAnalyst’s mutation score is higher
than DBMonster’s for 96% of the schemas
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems
179. Introduction Testing Technique Empirical Study Conclusion
Summary
Important Contributions
This paper presents SchemaAnalyst, a
search-based system for testing the complex
integrity constraints in relational schemas
The empirical study demonstrates that Schema-
Analyst’s efficiency is competitive with DBMonster’s
SchemaAnalyst almost always covers 100% of the
constraints in the 25 chosen relational schemas
SchemaAnalyst’s mutation score is higher
than DBMonster’s for 96% of the schemas
http://www.schemaanalyst.org
Kapfhammer, McMinn, and Wright March 19, 2013
Search-Based Testing of Relational Schema Integrity Constraints Across Multiple Database Management Systems