PriMera Scientific Engineering (ISSN: 2834-2550)

Research Article

Volume 4 Issue 6

On Enforcing Existence and Non-Existence Constraints in MatBase

Christian Mancas*

May 18, 2024

DOI : 10.56831/PSEN-04-130

View PDF

Abstract

Existence constraints were defined in the Relational Data Model, but, unfortunately, are not provided by any Relational Database Management System, except for their NOT NULL particular case. Our (Elementary) Mathematical Data Model extended them to function products and introduced their dual non-existence constraints. MatBase, an intelligent data and knowledge base management system prototype based on both these data models, not only provides existence and non-existence constraints, but also automatically generates code for their enforcement. This paper presents and discusses the algorithms used by MatBase to enforce these types of constraints.

Keywords: Existence and Non-Existence Constraints; The (Elementary) Mathematical Data Model; MatBase; Database Design; Non-relational Constraint Enforcement

References

  1. Codd EF. “A relational model for large shared data banks”. CACM 13.6 (1970): 377-387.
  2. Abiteboul S, Hull R and Vianu V. “Foundations of Databases”. Reading, MA: Addison-Wesley (1995).
  3. Mancas C. “Conceptual data modeling and database design: A completely algorithmic approach”. Volume I: The shortest advisable path. Palm Bay, FL: Apple Academic Press / CRC Press (Taylor & Francis Group) (2015).
  4. Mancas C. “MatBase Constraint Sets Coherence and Minimality Enforcement Algorithms”. in Benczur A., Thalheim B and Horvath T. (Eds). Advances in DB and Information Systems, LNCS Cham, Switzerland: Springer 11019 (2018): 263-277.
  5. Mancas C. “Conceptual data modeling and database design: A completely algorithmic approach”. Volume II: Refinements for an expert path. Palm Bay, FL: Apple Academic Press / CRC Press (Taylor & Francis Group); in press (2024).
  6. Mancas C. “MatBase - a Tool for Transparent Programming while Modeling Data at Conceptual Levels”. Proc. Int. Conf. on Comp. Sci. & Inf. Techn. (CSITEC 2019). Vienna, Austria (2019): 15-27.
  7. Chen PP. “The entity-relationship model. Toward a unified view of data”. ACM TODS 1.1 (1976): 9-36.
  8. Thalheim B. “Entity-Relationship Modeling - Foundations of Database Technology”. Berlin, Germany: Springer-Verlag (2000).
  9. Atzeni P, Batini C and De Antonellis V. “Relational Database Theory”. Reading, MA: Addison Wesley (1993).
  10. Lammari N and Metais E. “Automatic Help for Building and Maintaining Ontologies”. in Andersson, B., Bergholtz, M., and Johannesson, P. (Eds.). Natural Language Processing and Information Systems. LNCS 2553, Berlin, Heidelberg, Germany: Springer-Verlag (2002): 27-39.
  11. Furtado AL, dos Santos CS and de Castilho JMV. “Dynamic modelling of a simple existence constraint”. Information Systems 6.1 (1981): 73-80.
  12. Memgraph Documentation.
  13. Neo4J Docs Cypher Manual 5.
  14. Djelassi H and Mitsos A. “Global Solution of Semi-infinite Programs with Existence Constraints”. J Optim Theory Appl 188 (2021): 863-881.
  15. Mancas C. “On Modelware as the 5th Generation of Programming Languages”. Acta Scientific Computer Sciences 2.9 (2020): 24-26.
  16. Thalheim B. The Future: Modelling as Programming. Model-based development, modelling as programming case studies (2020).