Generating an Algebraic Specification from an ER-Model

Entity-Relationship modelling is a rather intuitive technique for specifying the structure of complex data. The technique is popular in part because the structure of an ER-model is easily grasped, and it is usually supported by diagrams or other visualizing tools. This paper deals with a detailed analysis of ER-modelling with the goal of deriving an algebraic specification for a given ER-model. This is motivated by considerations regarding program specification for data intensive applications. We indicate haw the technique demonstrated here may be combined with formal techniques for specifying the functional behavior of a system

ER modelling from first relational principles

Entity-Relationship modelling is a popular technique for data modelling. Despite its popularity and wide spread use, it lacks a firm semantic foundation. We propose a translation of an ER-model into relation algebra, suggesting that this kind of algebra does provide suitable mechanisms for establishing a formal semantics of Entity-Relationship modelling. The work reported on here deals first with the techniques necessary for the translation, thus constructing a static view of an ER-model in an abstract setting of what might be called logic without variables. We then undertake a detailed analysis of the insertion and deletion operations for an ER-model represented in terms of the relation calculus

Compiling ER Specifications into Declarative Programs

This paper proposes an environment to support high-level database programming in a declarative programming language. In order to ensure safe database updates, all access and update operations related to the database are generated from high-level descriptions in the entity- relationship (ER) model. We propose a representation of ER diagrams in the declarative language Curry so that they can be constructed by various tools and then translated into this representation. Furthermore, we have implemented a compiler from this representation into a Curry program that provides access and update operations based on a high-level API for database programming.Comment: Paper presented at the 17th Workshop on Logic-based Methods in Programming Environments (WLPE2007

Perbandingan Pengaruh Teknik Pemodelan Entity-relationship Model dan Resources-events-agents Model Atas Perancangan Database Perusahaan

Databases are an important part of most computer-based information systems. As such, the design of a database has also gained importance because a bad design will compromise data integrity as well as make it inefficient in its use of resources. This paper compares the effect of two data modeling approaches on the design of a database, specifically the Entity-Relationship Model (ER Model) and the Resources-Events -Agents Model (REA Model). First, the sales/collection cycle of a fictional case study is described. Then, an ER Model and a REA Model are independently created based on this case study. Finally, one database design is created based on the ER Model, and another database design is created based on the REA Model. The outcome of this experiment shows that both approaches produced similar database designs, but the design processes were different in their complexity, structurally, and completeness. A significant difference is that the ER Model closely followed those aspects that were already laid out by the case study, while the REA Model started out by building a most complete data model, over and above the one described in the case study

Perbandingan Pengaruh Teknik Pemodelan Entity-relationship Model dan Resources-events-agents Model Atas Perancangan Database Perusahaan

Databases are an important part of most computer-based information systems. As such, the design of a database has also gained importance because a bad design will compromise data integrity as well as make it inefficient in its use of resources. This paper compares the effect of two data modeling approaches on the design of a database, specifically the Entity-Relationship Model (ER Model) and the Resources-Events -Agents Model (REA Model). First, the sales/collection cycle of a fictional case study is described. Then, an ER Model and a REA Model are independently created based on this case study. Finally, one database design is created based on the ER Model, and another database design is created based on the REA Model. The outcome of this experiment shows that both approaches produced similar database designs, but the design processes were different in their complexity, structurally, and completeness. A significant difference is that the ER Model closely followed those aspects that were already laid out by the case study, while the REA Model started out by building a most complete data model, over and above the one described in the case study

Algebraic semantics of ER-models from the standpoint of map calculus. Part I: Static view

Entity-Relationship modeling is a popular technique for data modeling. Despite its popularity and wide spread use, it lacks a firm semantic foundation. We propose a translation of an ER-model into mapalgebra, suggesting that mapalgebra does provide suitable mechanisms for establishing a formal semantics of entity-relationship modeling. This report deals with the techniques necessary for the translation and provides a static view of an ER-model in its mapalgebraic disguise