Schema equivalence as a counting problem

Authors:
H. A. (Erik) Proper;Th. P. van der Weide
Affiliations:
Institute for Computing and Information Sciences, Radboud University Nijmegen, Nijmegen, The Netherlands, EU;Institute for Computing and Information Sciences, Radboud University Nijmegen, Nijmegen, The Netherlands, EU
Venue:
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
Year:
2005

Citing 2
Cited 0

Formal definition of a conceptual language for the description and manipulation of information models

Information Systems
Data model equivalence

VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce some terminology for comparing the expressiveness of conceptual data modeling techniques, 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 a better understanding of the fundamentals of modeling concepts (utility). We give some examples of finite equivalence and inequivalence in the context of ORM.