MatBase algorithm for translating (E)MDM schemes into E-R data models
This work provides a formal translation method for database designers working with (E)MDM and E-R models, but it is an incremental contribution within a specific domain.
The paper presents a linear, sound, complete, and semi-optimal algorithm for translating (E)MDM schemes into E-R data models, with an example application to a genealogical tree sub-universe.
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.