in

The ORM Foundation

Get the facts!

pdf Schema Equivalence as a Counting Problem

Downloads: 25 File Size: 282.9kB
Posted By: admin Views: 1,039
Date Added: 11-19-2007

Paper presented by H. A. (Erik) Proper(E.Proper@cs.ru.nl) and Th. P. van der Weide (Th.P.vanderweide@cs.ru.nl) , Institute for Computing and Information Sciences, Radboud University, Nijmegen, The Netherlands

Abstract:    In this paper we introduce some terminology for comparing the expressiveness of conceptual data modeling techjniques such as ER, NIAM, PSM and ORM, 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, which may serve as a means to better understanding of the fundamentals of modeling concepts (utility). We give some examples of finite equivalence and inequivalence in the context of ORM.  

The full paper is available from R.Meersman et al (Eds.): OTM workshops 2005, LNCS 3762, pp 730-739, Springer-Verlag Berlin Heidelberg  

Filed under:

Comments

No comments exist for this file.
© 2008-2014 The ORM Foundation: A UK not-for-profit organisation -------------- Terms of Service