The Binary Relationship Model (BRlVl) is a widely used meta-model in conceptual modeling because it is pa,rt of a methodology for information analysis, NIAM, and beca,use tools exist to map BRM conceptua.i models onto database definitions, The growing need to define semantics in conceptual models demands several extensions to BRM, among which is the definition of a constraint language. Because BRlVl has no formal semantic definition, the first step is to derive semantics for BRiVl schemas. In this paper, we give a formal definition of the semantics of a BRIVI schema and show the equivalence of BRM schemas to FDM schemas by giving a general mapping algorithm between these two schemas, Because the Functional Data Model has a well-defined semantics in terms of sets and functions, as well as a data language for expressing queries and constraints, the algorithm opens the way to well-defined extensions on the semantics of BRM. The extension of the results to N-ary relationship models is discussed,
[1]
David W. Shipman,et al.
The functional data model and the data languages DAPLEX
,
1981,
TODS.
[2]
Kees M. van Hee,et al.
Transforming Functional Database Schemes to Relational Representations
,
1992,
Specifications of Database Systems.
[3]
Arthur H. M. ter Hofstede,et al.
Semantics and verification of object-role models
,
1991,
Inf. Syst..
[4]
Ad Aerts,et al.
Combining the functional and the relational model
,
1990
.
[5]
Kees M. van Hee,et al.
Executable Specifications for Distributed Information Systems
,
1989,
International Symposium on Combinatorial Optimization.
[6]
Peter P. Chen.
The Entity-Relationship Model: Towards a unified view of Data
,
1976
.