Layering ER diagrams has been a key tool to abstract the complexity of large data schemas generated by enterprise modeling. However, the current approaches have a certain impedance between successive steps of refining (or abstracting) ER diagrams. First, most approaches do not have a well-defined correspondence between an entity at a higher level and the entity cluster at a lower level. Second, a relationship to a subentity from an entity in a higher plane is modeled using a relationship which breaks the encapsulation of the entity which contains the subentry. Clearly, it would be nice to have non-eneroaching relationships to model such situations. Finally, a refinement (abstraction) step adds (deletes) encroaching relationships and thus cascades changes to the schema beyond the current entity being refined (entity cluster being abstracted). This paper presents the Leveled Entity Relationship Model which demonstrates how one may have an abstraction formalism which does satisfy the above properties.
CITATION STYLE
Gandhi, M., Robertson, E. L., & van Gucht, D. (1994). Leveled entity relationship model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 881 LNCS, pp. 420–436). Springer Verlag. https://doi.org/10.1007/3-540-58786-1_94
Mendeley helps you to discover research relevant for your work.