On enforcing dyadic-type self-map constraints in MatBase
Department of Mathematics and Computer Science, Ovidius University at Constanta, Romania.
Research Article
International Journal of Frontiers in Engineering and Technology Research, 2023, 05(01), 014–026.
Article DOI: 10.53294/ijfetr.2023.5.1.0023
Publication history:
Received on 03 July 2023; revised on 12 August 2023; accepted on 15 August 2023
Abstract:
Self-maps 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 to guarantee their plausibility. The (Elementary) Mathematical Data Model provides 13 dyadic-type self-map 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 13 self-map constraint types, which may also be used by developers not having access to MatBase.
Keywords:
Database constraints; Self-maps; Dyadic relations; Modelling as programming; The (Elementary) Mathematical Data Model; MatBase
Full text article in PDF:
Copyright information:
Copyright © 2023 Author(s) retain the copyright of this article. This article is published under the terms of the Creative Commons Attribution Liscense 4.0