Core Concepts
MatBase implements algorithms for enforcing existence and non-existence constraints efficiently.
Abstract
The content discusses the implementation of existence and non-existence constraints in MatBase, a data management system. It covers the theoretical background, methodology, results, discussions, and practical applications of these constraints. The paper emphasizes the importance of formalizing business rules as constraints for data plausibility.
Structure:
Introduction to Existence Constraints in RDM
Definition of existence constraints in the Relational Data Model (RDM).
Lack of support for general existence constraints in commercial RDBMS.
Mathematical Data Model (MDM) Extension
Introduction of (E)MDM with total functions and NULLS concept.
Extension of existence constraints to computed functions.
Dual Non-Existence Constraints
Definition and application of non-existence constraints in (E)MDM.
Implementation Details in MatBase
Description of how MatBase enforces both types of constraints automatically.
Results, Discussions, and Algorithm Analysis
Propositions on algorithm properties related to constraint enforcement.
Conclusion and Future Implications
Importance of constraint enforcement for data quality standards.
Stats
"Existence constraints were defined in the Relational Data Model"
"MatBase provides a Graphic User Interface (GUI) MS Windows form for declaring both existence and non-existence constraints"
"Algorithm A1 from Figure 1 has complexity O(n + m)"
"Method BeforeUpdate from Figure 2 has complexity k = 4"
"Method enforce_existence_cnstr from Figure 3 returns true if values violate ec"
"Method enforce_non-existence_cnstr from Figure 4 distinguishes between single non-existent constraints"