pith. sign in

arxiv: 2512.00662 · v3 · submitted 2025-11-29 · 💻 cs.DB

MatBase algorithm for translating (E)MDM schemes into E-R data models

Christian Mancas , Diana Christina Mancas This is my paper

Pith reviewed 2026-05-17 02:43 UTC · model grok-4.3

classification 💻 cs.DB
keywords data modelingentity-relationship modelmathematical data modeltranslation algorithmdatabase designreverse engineeringlinear algorithmsoundness
0
0 comments X

The pith

A pseudocode algorithm translates (Elementary) Mathematical Data Model schemes into equivalent Entity-Relationship models.

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

The paper presents a pseudocode algorithm that converts schemes from the (Elementary) Mathematical Data Model into Entity-Relationship data models. It proves the algorithm runs in linear time, produces correct mappings for all inputs, covers every valid case, and reaches semi-optimality. The authors show the process on a genealogical tree example and note practical additions to its implementation in the MatBase system. A sympathetic reader would care because the method offers an automated, semantics-preserving bridge between two modeling approaches used in database design.

Core claim

The algorithm maps any valid (E)MDM scheme to an equivalent E-R model through a fixed set of mechanical rules that preserve all semantic information, and the authors prove this procedure is linear in time, sound, complete, and semi-optimal.

What carries the argument

The translation algorithm that applies fixed mapping rules from (E)MDM elements such as entities, relationships, and attributes to corresponding E-R constructs.

If this is right

  • Database designers can generate E-R diagrams from any valid (E)MDM scheme without manual intervention.
  • Semantic information remains intact during conversion, so no meaning is lost in the process.
  • The linear time bound makes the translation feasible even for large schemes.
  • The MatBase implementation supplies extra reverse-engineering features that build on this mapping.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The approach could support automated migration of database designs between modeling styles.
  • Similar mechanical translations might be developed for other pairs of data models.
  • Integration into broader design tools could reduce manual steps in creating and updating database schemas.

Load-bearing premise

Any valid (E)MDM scheme can be mechanically translated into an equivalent E-R model without loss of semantic information or need for additional human judgment.

What would settle it

A valid (E)MDM scheme on which the algorithm either fails to produce a fully equivalent E-R model, runs in more than linear time, or requires human intervention to resolve semantics would falsify the claims.

Figures

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

Figure 2
Figure 2. Figure 2: Method subModel of Algorithm REA2 [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Method addSet of Algorithm REA2 CITIES x  NAT(6) total City → ASCII(255) total Country : CITIES → COUNTRIES total Capital : COUNTRIES  CITIES (No city may simultaneously be the capital of 2 countries.) [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figure 5
Figure 5. Figure 5: Method computeCardinal of Algorithm REA2 [PITH_FULL_IMAGE:figures/full_fig_p010_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Method addAttributes of Algorithm REA2 DYNASTIES x  NAT(8) total Dynasty  ASCII(255) total (There may not be 2 dynasties having same name.) Country : DYNASTIES → COUNTRIES total [PITH_FULL_IMAGE:figures/full_fig_p010_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Method addStructuralFunctions of Algorithm REA2 [PITH_FULL_IMAGE:figures/full_fig_p011_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Method addFunctRestrictions of Algorithm REA2 [PITH_FULL_IMAGE:figures/full_fig_p011_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Method addRelationshipType of Algorithm REA2 [PITH_FULL_IMAGE:figures/full_fig_p011_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Method addEntityType of Algorithm REA2 [PITH_FULL_IMAGE:figures/full_fig_p011_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Algorithm REA2 methods’ dependencies TITLES x  NAT(2) total Title  ASCII(32) total (There may not be 2 titles having same name.) RULERS x  NAT(16) total Name → ASCII(255) total Sex → {‘M’, ‘F’, ‘N’} total (‘N’ is for non-persons) BirthYear → [-6500, CurrentYear()] PassedAwayYear → [-6500, CurrentYear()] URL  ASCII(255) (Any URL is dedicated to only one ruler.) Age = isNull(PassedAwayYear, CurrentYear(… view at source ↗
Figure 12
Figure 12. Figure 12: Single E-RD of RULERS URL: ASCII(255) c. Compulsory data: x, Name, Sex d. Uniqueness: Name • Dynasty • BirthYear (There may not be two persons of the same dynasty born in the same year and having the same name.) URL (Any URL is dedicated to only one ruler.) e. Other types of restrictions: Age = isNull(PassedAwayYear, CurrentYear()) – BirthYear Mother acyclic (Nobody may be his/her maternal ancestor or des… view at source ↗
Figure 13
Figure 13. Figure 13: Structural E-RD of the (E)MDM schema 6. Discussion Proposition REA2 is: (i) linear, having complexity O(n + a + m + c), where n is the total number of the (E)MDM schema non-value sets, a is the total number of their attributes, m of their structural functions (including the roles of the relationship-type sets), and c is the total number of its constraints; (ii) sound; (iii) complete; (iv) semi-optimal. Pr… view at source ↗
read the original abstract

This paper presents a pseudocode algorithm for translating (Elementary) Mathematical Data Model ((E)MDM) schemes into Entity-Relationship data models. We prove that this algorithm is linear, sound, complete, and semi-optimal. As an example, we apply this algorithm to an (E)MDM scheme for a genealogical tree sub-universe. We also provide the main additional features added to the implementation of this data science reverse engineering algorithm in MatBase, our intelligent knowledge and database management system prototype based on both the Entity-Relationship, (E)MDM, and Relational Data Models.

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 / 2 minor

Summary. The paper presents a pseudocode algorithm for translating (Elementary) Mathematical Data Model ((E)MDM) schemes into Entity-Relationship (E-R) data models. It claims to prove that this algorithm is linear, sound, complete, and semi-optimal. The algorithm is illustrated via application to an (E)MDM scheme for a genealogical tree sub-universe, and the paper describes additional features implemented in the MatBase prototype system.

Significance. If the claimed properties hold with rigorous support, the work would provide a practical automated translation method between mathematical and E-R modeling paradigms, aiding reverse engineering tasks in database design and knowledge management systems. The integration with the MatBase implementation adds applied value, though the current lack of detailed proof support limits immediate significance.

major comments (2)
  1. [Abstract and algorithm properties section] Abstract and claims of algorithm properties: The paper asserts proofs of linearity, soundness, completeness, and semi-optimality but supplies no derivation details, lemmas, error analysis, or edge-case handling. Completeness in particular requires exhaustive case analysis showing every (E)MDM construct (e.g., elementary functions, constraints, higher-order relations) maps losslessly to E-R without external judgment; the single genealogical-tree example does not discharge this.
  2. [Example and completeness discussion] Completeness argument: The central claim that any valid (E)MDM scheme translates mechanically to an equivalent E-R model rests on an unstated assumption that all constructs have direct, canonical E-R equivalents. Without formal semantics for both models and a full case analysis, the completeness result cannot be verified from the provided material.
minor comments (2)
  1. [Implementation section] The description of MatBase implementation features would benefit from concrete examples of how the translation algorithm is embedded and any performance metrics observed.
  2. [Introduction and notation] Notation for (E)MDM elements should be defined more explicitly at first use to aid readers unfamiliar with the model.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive feedback on our manuscript. We address each major comment below, indicating where we will revise the paper to improve clarity and rigor.

read point-by-point responses

  1. Referee: [Abstract and algorithm properties section] Abstract and claims of algorithm properties: The paper asserts proofs of linearity, soundness, completeness, and semi-optimality but supplies no derivation details, lemmas, error analysis, or edge-case handling. Completeness in particular requires exhaustive case analysis showing every (E)MDM construct (e.g., elementary functions, constraints, higher-order relations) maps losslessly to E-R without external judgment; the single genealogical-tree example does not discharge this.

    Authors: We agree that the current manuscript states the four properties in the abstract and properties section without including full derivation details, lemmas, or explicit edge-case analysis. Linearity is established by counting the constant-time operations performed on each input construct. Soundness follows from the direct mapping rules that preserve (E)MDM semantics in the resulting E-R diagram. Completeness and semi-optimality rest on the claim that the rule set covers all standard (E)MDM constructs. The genealogical-tree example serves only as illustration. To address the concern, we will add a dedicated subsection with lemmas for each property, a brief error analysis, and an explicit enumeration of how elementary functions, constraints, and higher-order relations are translated. revision: yes

  2. Referee: [Example and completeness discussion] Completeness argument: The central claim that any valid (E)MDM scheme translates mechanically to an equivalent E-R model rests on an unstated assumption that all constructs have direct, canonical E-R equivalents. Without formal semantics for both models and a full case analysis, the completeness result cannot be verified from the provided material.

    Authors: The manuscript relies on the established correspondence between (E)MDM and E-R constructs documented in prior literature on both models, which is why a self-contained formal semantics section was omitted. The algorithm encodes this correspondence as a fixed set of translation rules. We acknowledge that a reader unfamiliar with those equivalences cannot verify completeness from the given material alone. In the revision we will insert a short subsection that recalls the relevant semantic mappings and supplies a more systematic case analysis covering the main construct categories. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper presents a pseudocode algorithm for translating (E)MDM schemes into E-R models, claims proofs of linearity/soundness/completeness/semi-optimality, and illustrates with a genealogical tree example. No quoted derivation step reduces by construction to a self-definition, a fitted input renamed as prediction, or a load-bearing self-citation chain. The central claims rest on the algorithm design and case analysis rather than re-deriving inputs from outputs or importing uniqueness via prior self-work as an unverified axiom. The presentation is self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the existence of a mechanical translation that preserves semantics between the two modeling formalisms; no free parameters or invented entities are mentioned. Proofs presumably rely on standard mathematical induction or graph traversal arguments.

axioms (1)
  • domain assumption Any valid (E)MDM scheme has a corresponding E-R representation that can be derived algorithmically without additional semantic input.
    Implicit in the claim that the algorithm is complete and sound for all inputs.

pith-pipeline@v0.9.0 · 5393 in / 1203 out tokens · 72321 ms · 2026-05-17T02:43:27.564732+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

23 extracted references · 23 canonical work pages

  1. [1]

    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

  2. [2]

    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

  3. [3]

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

    work page 2000

  4. [4]

    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

  5. [5]

    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

  6. [6]

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

    work page 1995

  7. [7]

    MatBase – a tool for transparent programming while modeling data at conceptual levels

    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. . https://aircconline.com/csit/papers/vol9/csit91102.pdf

    work page 2019

  8. [8]

    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

  9. [9]

    & Mancas, D.C

    Mancas, C. & 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 24

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

  10. [10]

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

    work page 2023

  11. [11]

    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

  12. [12]

    (2025, November 19)

    Quest. (2025, November 19). erwin Data Modeler by Quest. https://www.quest.com/documents/erwin-data-modeler-datasheet-147769.pdf

    work page 2025

  13. [13]

    (2025, November 19)

    Microsoft SQL Documentation. (2025, November 19). SQL Server Management Studio. https://learn.microsoft.com/pdf?url=https%3A%2F%2Flearn.microsoft.com%2Fen- us%2Fssms%2Ftoc.json

    work page 2025

  14. [14]

    & Dragomir, S

    Mancas, C. & Dragomir, S. On the Equivalence between Entity -Relationship and Functional Data Modeling. Proc. IASTED Software Eng. & App. SEA 2003 , Marina del Rey, U.S.A., (2003), 335–340. https://www.actapress.com/Abstract.aspx?paperId=14533

    work page 2003

  15. [15]

    (2025, November 19)

    Oracle Corp. (2025, November 19). Oracle SQL Developer Data Modeler User’s Guide. https://docs.oracle.com/en/database/oracle/sql-developer-data- modeler/24.3/dmdug/data-modeler-concepts-usage.html#GUID-69B12E47-6075-4471- A205-BBB04113EE24

    work page 2025

  16. [16]

    (2025, November 19)

    IBM Software Hub. (2025, November 19). IBM Db2 Data Management Console. https://www.ibm.com/docs/en/software-hub/5.2.x?topic=services-db2-data- management-console

    work page 2025

  17. [17]

    (2025, November 19)

    Dataedo. (2025, November 19). Create diagram for IBM Db2 database. https://dataedo.com/tutorials/create-diagram-for-ibm-db2-database

    work page 2025

  18. [18]

    & Goldberg, L

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

    work page 2006

  19. [19]

    Taylor, J. (2019). Decision Management Systems: A Practical Guide to Using Business Rules and Predictive Analytics. IBM Press

    work page 2019

  20. [20]

    (2025, November 19)

    IBM Corp. (2025, November 19). IBM Business Automation Manager Open Editions. https://www.ibm.com/docs/en/ibamoe/9.3.0

    work page 2025

  21. [21]

    (2025, November 19)

    Red Hat Documentation. (2025, November 19). Designing your decision management architecture with Red Hat Decision Manager. https://docs.redhat.com/en/documentation/red_hat_decision_manager/7.13/html/designi ng_your_decision_management_architecture_for_red_hat_decision_manager/index

    work page 2025

  22. [22]

    (2025, November 19)

    DecisionRules.io. (2025, November 19). DecisionRules Documentation. https://docs.decisionrules.io/doc/

    work page 2025

  23. [23]

    Mancas, C. (2025). On Enforcing Satisfiable, Coherent, and Minimal Sets of Self -map Constraints in MatBase. Primera Scientific Engineering 6(2), 31 –49. https://10.56831/PSEN-06-179

    work page doi:10.56831/psen-06-179 2025