A note on Schema Equivalence

Abstract

In this paper we introduce some terminology for comparing the expressiveness of conceptual data modelling techniques, such as ER, NIAM, and PM, that are finitely bounded by their underlying domains. Next we consider schema equivalence and discuss the effects of the sizes of the underlying domains. This leads to the introduction of the concept of finite equivalence. We give some examples of finite equivalence and inequivalence in the context of PM.

8 Figures and Tables

Cite this paper

@inproceedings{Hofstede1992ANO, title={A note on Schema Equivalence}, author={Arthur ter Hofstede and Henderik Alex Proper and Th P Van Der Weide and Th P Van Der and Weide A Note On Schema}, year={1992} }