Skip to main content

A Closer Look at the Join-Equality Constraint

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

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

  • 1639 Accesses

Abstract

Assume an ORM-diagram where there exist two (or more) paths from one entity type to another through a sequence of many-to-one binary facts. Here we may have a join-equality constraint saying that if we follow the different paths from an instance of the first entity type, we should find the same instance of the second entity type. This constraint is inherent in most ticketing/reservation systems, where it may give rise to overlapping foreign keys in the relational database. Another interesting observation is that if a relation is in 3NF, but not in BCNF, there must be a join-equality constraint in the underlying model.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Codd, E.F.: Recent investigations in Relational Database Systems. In: Proceedings of the IFIP Congress (1974)

    Google Scholar 

  2. Codd, E.F.: Extending the Database Relational Model to Capture More Meaning. ACM Transactions on Database Systems 4(4) (1979)

    Google Scholar 

  3. Date, C.: Relational Database, Writings. Addison Wesley, Reading (1990)

    MATH  Google Scholar 

  4. Elmasri, R., Navathe, S.B.: Fundamentals of Database Systems. Pearson/Addison Wesley, Boston (2007)

    MATH  Google Scholar 

  5. Halpin, T.: Join Constraints, http://www.orm.net/pdf/JoinConstraints.pdf

  6. Halpin, T., Morgan, T.: Information Modeling and Relational Databases, 2nd edn. Morgan Kaufmann Publishers, San Francisco (2008)

    Google Scholar 

  7. Skagestein, G.: Data i fokus, Universitetsforlaget, Oslo (1991)

    Google Scholar 

  8. Skagestein, G., Thorvaldsen, A.: Arbeidshefte til Fra virkelighet til datamodell, Universitetsforlaget, Oslo (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Skagestein, G., Normann, R. (2008). A Closer Look at the Join-Equality Constraint. In: Meersman, R., Tari, Z., Herrero, P. (eds) On the Move to Meaningful Internet Systems: OTM 2008 Workshops. OTM 2008. Lecture Notes in Computer Science, vol 5333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88875-8_102

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88875-8_102

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88874-1

  • Online ISBN: 978-3-540-88875-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics