Assume an ORM-diagram where there exist two (or more) paths from one entity type to another through a sequence of many-toone 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.
CITATION STYLE
Skagestein, G., & Normann, R. (2008). A closer look at the join-equality constraint. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5333, pp. 780–786). Springer Verlag. https://doi.org/10.1007/978-3-540-88875-8_102
Mendeley helps you to discover research relevant for your work.