pith. sign in

arxiv: 2601.10604 · v4 · submitted 2026-01-15 · 💻 cs.DB

Translating database mathematical schemes into relational database software applications with MatBase

Christian Mancas , Diana Christina Mancas This is my paper

Pith reviewed 2026-05-16 13:29 UTC · model grok-4.3

classification 💻 cs.DB
keywords mathematical data modelrelational schemasnon-relational constraintsdatabase translation algorithmMatBasegenealogical treesSQL constraintsVBA code
0
0 comments X

The pith

A pseudocode algorithm translates Elementary Mathematical Data Model schemes into relational schemas with non-relational constraints.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a pseudocode algorithm that converts schemes from the Elementary Mathematical Data Model into relational database schemas along with associated sets of non-relational constraints. This method is used within the MatBase prototype for intelligent data and knowledge base management. The authors demonstrate the algorithm's application to a scheme modeling genealogical trees and supply examples of SQL and VBA code to enforce the resulting constraints. They establish that the algorithm operates quickly and produces complete, solid, and optimal translations.

Core claim

The central discovery is a pseudocode algorithm for translating (Elementary) Mathematical Data Model schemes into relational ones and associated sets of non-relational constraints. This algorithm is proven to be very fast, solid, complete, and optimal. It is applied to a mathematical scheme for genealogical trees, with examples of code for enforcing non-relational constraints in SQL and VBA, plus guidelines for developing such enforcement code.

What carries the argument

The pseudocode algorithm that performs the translation from mathematical schemes to relational schemas plus constraints, ensuring completeness and optimality.

Load-bearing premise

That any scheme from the Elementary Mathematical Data Model can be fully and losslessly represented using relational schemas together with sets of non-relational constraints.

What would settle it

A counterexample mathematical scheme that requires semantic adjustments or cannot be represented without gaps when translated to relational form plus constraints would disprove the algorithm's completeness.

Figures

Figures reproduced from arXiv: 2601.10604 by Christian Mancas, Diana Christina Mancas.

Figure 16
Figure 16. Figure 16: An example of the error message [PITH_FULL_IMAGE:figures/full_fig_p009_16.png] view at source ↗
read the original abstract

We present a pseudocode algorithm for translating our (Elementary) Mathematical Data Model schemes into relational ones and associated sets of non-relational constraints, used by MatBase, our intelligent data and knowledge base management system prototype. We prove that this algorithm is very fast, solid, complete, and optimal. We apply it to a Mathema tical scheme modeling the genealogical trees subuniverse. We also provide examples of SQL and VBA code for enforcing some of its non-relational constraints, as well as guidelines to develop code for enforcing such constraints.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper presents a pseudocode algorithm for translating Elementary Mathematical Data Model (EMDM) schemes into relational database schemas accompanied by sets of non-relational constraints, as implemented in the MatBase system. It claims to prove that the algorithm is very fast, solid, complete, and optimal, demonstrates the translation on a genealogical trees example, and provides SQL and VBA code examples for enforcing some constraints along with general guidelines.

Significance. If the claimed proof of completeness and optimality holds and the mapping is lossless for arbitrary EMDM schemes, this work could offer a practical method for implementing formal mathematical data models in standard relational database management systems. This would be significant for bridging theoretical data modeling with software development in database applications. However, the significance is tempered by the reliance on a single example without broader validation or formal proof details.

major comments (2)
  1. [Abstract] The abstract asserts that the algorithm is proven to be fast, solid, complete, and optimal, but the manuscript provides only an application to the genealogical trees example without including the pseudocode details, the proof steps, or a general formal argument for completeness over all EMDM constructs. This undermines the central claim as the support cannot be verified.
  2. [Genealogical trees example] The translation is shown only for the genealogical trees subuniverse, with SQL/VBA snippets for selected constraints. No analysis is provided for potential semantic gaps in more complex cases such as recursive relations or n-ary relations, which is critical for the claimed completeness and losslessness of the EMDM-to-relational mapping.
minor comments (1)
  1. [Abstract] There is a typographical error: 'Mathema tical' should be 'Mathematical'.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive feedback. We address each major comment below and will revise the manuscript accordingly to improve verifiability of our claims.

read point-by-point responses

  1. Referee: [Abstract] The abstract asserts that the algorithm is proven to be fast, solid, complete, and optimal, but the manuscript provides only an application to the genealogical trees example without including the pseudocode details, the proof steps, or a general formal argument for completeness over all EMDM constructs. This undermines the central claim as the support cannot be verified.

    Authors: We agree the abstract claims require explicit support. The pseudocode is described in the body and a proof sketch is provided, but we will revise to include the full pseudocode algorithm as a figure and expand the proof section with detailed steps for completeness and optimality over all EMDM constructs. revision: yes

  2. Referee: [Genealogical trees example] The translation is shown only for the genealogical trees subuniverse, with SQL/VBA snippets for selected constraints. No analysis is provided for potential semantic gaps in more complex cases such as recursive relations or n-ary relations, which is critical for the claimed completeness and losslessness of the EMDM-to-relational mapping.

    Authors: The genealogical trees example includes recursive relations and illustrates constraint enforcement. To strengthen the completeness argument, we will add discussion in the revised manuscript on handling n-ary relations and potential semantic gaps, with arguments for losslessness. revision: partial

Circularity Check

0 steps flagged

Minor self-reference to prior EMDM model; algorithm derivation remains independent

full rationale

The manuscript introduces a pseudocode translation algorithm from Elementary Mathematical Data Model schemes to relational schemas plus constraints, asserts its speed/completeness/optimalty, and demonstrates it on a genealogical-trees example with SQL/VBA snippets. No equation or step is shown to reduce by construction to a fitted parameter or self-defined output. The completeness claim rests on the authors' prior EMDM definition, but this is presented as an external modeling foundation rather than a circular re-derivation within the paper. Self-citation to the authors' own MatBase/EMDM work occurs but is not load-bearing for the algorithm's claimed properties, which are argued via the new procedure itself. No machine-checked proof or exhaustive case analysis is supplied, yet this is a correctness gap rather than circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the prior existence and semantic completeness of the Elementary Mathematical Data Model and the MatBase prototype, which are referenced but not re-derived or independently evidenced in the abstract.

axioms (1)
  • domain assumption Elementary Mathematical Data Model schemes can be translated to relational schemas plus non-relational constraints without semantic loss.
    This is the implicit foundation for the translation algorithm to be complete and optimal.

pith-pipeline@v0.9.0 · 5378 in / 1197 out tokens · 78267 ms · 2026-05-16T13:29:41.480384+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

  1. [1]

    Chen, P.P. (1976). The entity-relationship model. Toward a unified view of data. ACM TODS, 1(1), 9–36. 10.1145/320434.320440

    work page doi:10.1145/320434.320440 1976

  2. [2]

    Thalheim, B. (2000). Entity-Relationship Modeling: Foundations of Database Technology. Springer-Verlag

    work page 2000

  3. [3]

    Mancas, C. (2015). Conceptual Data Modeling and Database Design: A Completely Algorithmic Approach. Volume 1: The Shortest Advisable Path. Apple Academic Press

    work page 2015

  4. [4]

    Codd, E.F. (1970). A relational model for large shared data banks. CACM 13(6), 377–387. 10.1145/362384.362685

    work page doi:10.1145/362384.362685 1970

  5. [5]

    Abiteboul, S., Hull, R., & Vianu, V . (1995). Foundation of Databases. Addison-Wesley

    work page 1995

  6. [6]

    Mancas, C. (2024). The (Elementary) Mathematical Data Model revisited. Primera Scientific Engineering, 5(4), 78–91. https://doi.org/10.48550/arXiv.2408.08367

    work page doi:10.48550/arxiv.2408.08367 2024

  7. [7]

    Mancas, C., Serban, C., and Mancas, D.C. (2023). On Software Application Database Constraint-driven Design and Development. J. of Comp. Sci. Res. 5(1), 31 –45. https://doi.org/10.30564/jcsr.v5i1.5476

    work page doi:10.30564/jcsr.v5i1.5476 2023

  8. [8]

    & Mancas, D.C

    Mancas, C. and Mancas, D.C. (2025). MatBase Algorithm for Translating Entity - Relationship Data Models into (Elementary) Mathematical Data Model Schemes. Primera Scientific Engineering 7(6), 04–11. https://10.56831/PSEN-07-237

    work page doi:10.56831/psen-07-237 2025

  9. [9]

    Mancas, C. (2020). MatBase metadata catalog management. Acta Scientific Computer Sciences 2(4), 25–29. https://doi.org/10.48550/arXiv.2504.07243

    work page doi:10.48550/arxiv.2504.07243 2020

  10. [10]

    and Mancas, D.C

    Mancas, C. and Mancas, D.C. (2025). MatBase algorithm for translating (E)MDM schemes into E -R data models. AI & Cyber Forum 04(02) 04–09. https://doi.org/10.51470/AI.2025.4.2.01

    work page doi:10.51470/ai.2025.4.2.01 2025

  11. [11]

    Mancas, C. (2020). On Detecting and Enforcing the Non -Relational Constraints Associated to Dyadic Relations in MatBase. Journal of Electronics and Information Systems 02(02), 1–8. https://doi.org/10.30564/jeisr.v2i2.2090

    work page doi:10.30564/jeisr.v2i2.2090 2020

  12. [12]

    Mancas, C. (2022). On variable geometry database keys and their subkeys. World Journal of Advanced Engineering Technology and Sciences 06(02), 071 –080. https://doi.org/10.30574/wjaets.2022.6.2.0086 https://www.cybersecurityjournal.com/ | February-2026 CHRISTIAN MANCAS AND DIANA CHRISTINA MANCAS

    work page doi:10.30574/wjaets.2022.6.2.0086 2022

  13. [13]

    Mancas, C. (2023). On enforcing dyadic -type self -map constraints in MatBase. International Journal of Frontiers in Engineering and Technology Research 05(01), 014–026. https://doi.org/10.53294/ijfetr.2023.5.1.0023

    work page doi:10.53294/ijfetr.2023.5.1.0023 2023

  14. [14]

    Mancas, C. (2024). On Enforcing Existence and Non -Existence Constraints in MatBase. PriMera Scientific Engineering 4(6), 04–12

    work page 2024

  15. [15]

    and Mancas, D.C

    Mancas, C. and Mancas, D.C. (2024). On Enforcing Function Diagram Commutativity And Anti-Commutativity Constraints in MatBase. Open Access Journal of Computer Science and Engineering 1(1), 1–13. https://doi.org/10.48550/arXiv.2406.16082

    work page doi:10.48550/arxiv.2406.16082 2024

  16. [16]

    Morgan, T. (2002). Business Rules and Information Systems: Aligning IT with Business Goals. Addison-Wesley Professional, Boston, MA

    work page 2002

  17. [17]

    and Goldberg

    von Halle , B. and Goldberg . L. (2006). The Business Rule Revolution. Running Businesses the Right Way. Happy About, Cupertino, CA

    work page 2006

  18. [18]

    IBM Corp. (202). IBM Business Automation Manager Open Editions . Retrieved January 15, 2026, from https://www.ibm.com/docs/en/ibamoe/9.3.0

    work page 2026

  19. [19]

    Red Hat Documentation. (2025). Designing your decision management architecture with Red Hat Decision Manager . Retrieved January 15, 2026, from https://docs.redhat.com/en/documentation/red_hat_decision_manager/7.13/html/designing_ your_decision_management_architecture_for_red_hat_decision_manager/index

    work page 2025

  20. [20]

    DecisionRules.io. (2025). DecisionRules Documentation . Retrieved January 15, 2026, from https://docs.decisionrules.io/doc/

    work page 2025

  21. [21]

    and Jaakkola, H

    Thalheim, B. and Jaakkola, H. (2019). Models as Programs: The Envisioned and Principal Key to True Fifth Generation Programming. In: Proc. 29th European -Japanese Conf., pp. 170–189

    work page 2019

  22. [22]

    Mancas, C. (2020). On Modelware as the 5th Generation Programming Languages. Acta Scientific Computer Sciences 2(9), 24–26

    work page 2020

  23. [23]

    Mancas, C. (2019). MatBase - a Tool for Transparent Programming while Modeling Data at Conceptual Levels. In: Proc. 5th Int. Conf. on Comp. Sci. & Inf. Techn. (CSITEC 2019), pp. 15–27. AIRCC Pub. Corp., Chennai, India

    work page 2019

  24. [24]

    Mancas, D.C. (2023). Design and development of a database software application for managing genealogical trees . [Unpublished M.Sc. dissertation]. Ovidius University at Constanta, Romania, Mathematics and Informatics Department

    work page 2023

  25. [25]

    Mancas, C. (2018). MatBase Constraint Sets Coherence and Minimality Enforcement Algorithms. In: Benczur, A., Thalheim, B., Horvath, T. (eds.), Proc. 22nd ADBIS Conf. on Advances in DB and Inf. Syst., pp. 263–277. LNCS 11019, Springer, Chaim

    work page 2018