On enforcing dyadic relationship constraints in MatBase

Abstract

Dyadic relationships are widely encountered in the sub-universes modeled by databases, from genealogical trees to sports, from education to healthcare, etc. Their properties must be discovered and enforced by the software applications managing such data, in order to guarantee their plausibility. The (Elementary) Mathematical Data Model provides 11 dyadic relationship constraint types. MatBase, an intelligent data and knowledge base management system prototype, allows database designers to simply declare them by only clicking corresponding checkboxes and automatically generates code for enforcing them. This paper describes the algorithms that MatBase uses for enforcing all these 11 dyadic relationship constraint types.