On enforcing dyadic relationship constraints in MatBase
Mathematics and Computer Science Department, Ovidius University, Constanta, Romania.
Research Article
World Journal of Advanced Engineering Technology and Sciences, 2023, 09(02), 298–311.
Article DOI: 10.30574/wjaets.2023.9.2.0211
Publication history:
Received on 06 June 2023; revised on 18 July 2023; accepted on 21 July 2023
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.
Keywords:
Database constraints; 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