Schema Equivalence as a Counting Problem | SpringerLink
Skip to main content
Springer Nature Link
Log in

Schema Equivalence as a Counting Problem

  • Conference paper
On the Move to Meaningful Internet Systems 2005: OTM 2005 Workshops (OTM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3762))

  • 555 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. van Bommel, P., ter Hofstede, A.H.M., van der Weide, T.P.: Semantics and verification of object-role models. Information Systems 16(5), 471–495 (1991)

    Article  Google Scholar 

  2. Borkin, S.A.: Data Model Equivalence. In: Proceedings of the Fourth International Conference on Very Large Data Bases, pp. 526–534 (1978)

    Google Scholar 

  3. Crossley, J.N., Ash, C.J., Brickhill, C.J., Stillwell, J.C., Williams, N.H.: What is mathematical logic? Oxford University Press, Oxford (1972)

    Google Scholar 

  4. ter Hofstede, A.H.M. (Erik) Proper, H.A., van der Weide, T.P.: Formal definition of a conceptual language for the description and manipulation of information models. Information Systems 18(7), 489–523 (1993)

    Article  Google Scholar 

  5. Information processing systems – Concepts and Terminology for the Conceptual Schema and the Information Base (1987), ISO/TR 9007: http://www.iso.org

Download references

Author information

Authors and Affiliations

  1. Institute for Computing and Information Sciences, Radboud University Nijmegen, Toernooiveld 1, 6525 ED, Nijmegen, The Netherlands, EU

    H. A. (Erik) Proper & Th. P. van der Weide

Authors
  1. H. A. (Erik) Proper
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Th. P. van der Weide
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. STARLab, Vrije Universiteit Brussel (VUB), Bldg G/10, Pleinlaan 2, 1050, Brussels, Belgium

    Robert Meersman

  2. School of Computer Science and Information Technology, RMIT University, Bld 10.10, 376-392 Swanston Street, 3001, Melbourne, VIC, Australia

    Zahir Tari

  3. Facultad de Informática, Universidad Politécnica de Madrid, Campus de Montegancedo S/N, 28660, Boadilla del Monte, Madrid, Spain

    Pilar Herrero

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Proper, H.A.(., van der Weide, T.P. (2005). Schema Equivalence as a Counting Problem. In: Meersman, R., Tari, Z., Herrero, P. (eds) On the Move to Meaningful Internet Systems 2005: OTM 2005 Workshops. OTM 2005. Lecture Notes in Computer Science, vol 3762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11575863_92

Download citation

  • DOI: https://doi.org/10.1007/11575863_92

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29739-0

  • Online ISBN: 978-3-540-32132-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics