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

TL;DR

This paper introduces a pseudocode algorithm for converting (E)MDM schemes into E-R models, demonstrating its linearity, soundness, completeness, and semi-optimality through an example and implementation in MatBase.

Contribution

It presents a novel, efficient algorithm for translating (E)MDM schemes into E-R models, with proofs of its properties and implementation details.

Findings

Algorithm is linear, sound, complete, and semi-optimal.

Successfully applied to a genealogical tree (E)MDM scheme.

Implemented in the MatBase system with added features.

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.