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

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Mancas, Christian, Mancas, Diana Christina
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866911665779376128
author Mancas, Christian
Mancas, Diana Christina
author_facet Mancas, Christian
Mancas, Diana Christina
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2512_00662
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle MatBase algorithm for translating (E)MDM schemes into E-R data models
Mancas, Christian
Mancas, Diana Christina
Databases
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.
title MatBase algorithm for translating (E)MDM schemes into E-R data models
topic Databases
url https://arxiv.org/abs/2512.00662