Simplified integrity checking for an expressive class of denial constraints

2024-12-30

AI Summary

Efficiently verifying complex (especially negation-based) integrity constraints in data-intensive systems remains challenging. Method: This paper proposes a lightweight, automated checking framework for extended denial constraints—more expressive than tgds and egds—by introducing program transformation into integrity verification. It employs formal constraint modeling, constraint-driven SQL equivalence simplification, and automatic SQL generation, enabling incremental validation under database consistency assumptions. Contribution/Results: The approach breaks from traditional syntax-bound verification paradigms, supporting direct deployment of standard SQL without custom extensions. Under strict semantic equivalence, it significantly reduces runtime overhead while maintaining compatibility with mainstream OLTP systems.

Technology Category

• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Data Mining & Knowledge Management: Intelligent Query Processing
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning

Application Category

• Semantics and Knowledge: Provenance, trust, security and privacy, and ethical issues in managing semantic data
• Systems and Infrastructure for Web, Mobile and WoT: Data management and stream processing for Web, mobile and wireless applications
• Search and Retrieval-Augmented AI: Web evaluation methodologies and metrics

Abstract

Data integrity is crucial for ensuring data correctness and quality, maintained through integrity constraints that must be continuously checked, especially in data-intensive systems like OLTP. While DBMSs handle common constraints well, complex constraints often require ad-hoc solutions. Research since the 1980s has focused on automatic and simplified integrity constraint checking, leveraging the assumption that databases are consistent before updates. This paper discusses using program transformation operators to generate simplified integrity constraints, focusing on complex constraints expressed in denial form. In particular, we target a class of integrity constraints, called extended denials, which are more general than tuple-generating dependencies and equality-generating dependencies. These techniques can be readily applied to standard database practices and can be directly translated into SQL.

Problem

• Data Integrity Rules
• Automated Correctness Checking
• Data Quality Assurance

Innovation

• Program Transformation
• Complex Data Integrity Rules
• Automated Verification