Skip to main content

Advances in FCO-IM (2): A Shorter Algorithm for Determining Intra Fact Type Uniqueness Constraints

  • Conference paper

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

Abstract

We present a general algorithm for determining all intra fact type uniqueness constraints in a fact type with n roles. For Fact Oriented Methods of information modeling that work with elementary fact types, a top-down approach is shorter than a bottom-up approach for fact types with more than two roles. The algorithm is shorter (in terms of the number of tests to be performed) than the one published earlier in our book on FCO-IM. For its most important steps, we prove that no shorter algorithm exists.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bakema, G., Zwart, J.P., van der Lek, H.: Fully Communication Oriented Information Modeling (FCO-IM), The book can be downloaded for free from the website of [3] (2002), http://www.casetalk.com/php/index.php?FCO-IM%20English%20Book

  2. Bakema, G., Zwart, J.P., van der Lek, H.: Fully Communication Oriented NIAM. In: NIAM-ISDM 1994 Conference, Working Papers, Albuquerque, USA (1994)

    Google Scholar 

  3. BCP Software: CaseTalk, FCO-IM modeling tool, see http://www.CaseTalk.com

  4. Halpin, T.: Information Modeling and Relational Databases. Morgan Kaufmann Publishers, San Francisco (2001)

    Google Scholar 

  5. Halpin, T.: What is an elementary fact?, NIAM-ISDM 1993 Conference, Working Papers, Albuquerque, USA (1993). Also available in slightly edited form on the web from http://www.orm.net/pdf/ElemFact.pdf

  6. ter Hofstede, Arthur H.M: Information Modelling in Data Intensive Domains, PhD-thesis, Radboud University Nijmegen, the Netherlands (1993) ISBN 90-9006263-X

    Google Scholar 

  7. Korth, H.K., Silberschatz, A.: Database System Concepts. McGraw-Hill, New York (1986)

    MATH  Google Scholar 

  8. Nijssen, G.M., Halpin, T.A.: Conceptual Schema and Relational Database Design. Prentice Hall, Englewood Cliffs (1989)

    Google Scholar 

  9. Proper, H.A.: A theory for Conceptial Modelling of Evolving Application Domains, PhD Thesis, Radboud University, Nijmegen, the Netherlands, ISBN 90-9006849-X (1994)

    Google Scholar 

  10. Wintraecken, J.J.V.R.: Informatie-analyse volgens NIAM, Academic Service, ISBN 90-6233-169-6 (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Robert Meersman Zahir Tari Pilar Herrero

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zwart, J.P., Bakema, G. (2007). Advances in FCO-IM (2): A Shorter Algorithm for Determining Intra Fact Type Uniqueness Constraints. In: Meersman, R., Tari, Z., Herrero, P. (eds) On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops. OTM 2007. Lecture Notes in Computer Science, vol 4805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76888-3_94

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76888-3_94

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76887-6

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics