Abstract
So far, relational algebra has been presented in its classical form. Relations are often conceived as something that might be called quadratic or homogeneous; a relation over a set. It is interpreted as a subset R ⊂ U × U of a Cartesian product of the universe U with itself. If relations between two or more sets are considered, this may easily be subsumed under this view, uniting all the sets in question into one huge set and calling this set the universe U. On the other hand, a variant of the theory has evolved that treats relations from the very beginning as heterogeneous or rectangular, i.e. as relations where the normal case is that they are relations between two different sets. The present chapter is devoted to this variant form.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Notes
To avoid set-theoretic problems we restrict ourselves to categories where every class of mor-phisms MorR [A, B] is a set. Such categories are called locally small.
Recall that in Chapt. 1 the small circle was used for composition of morphisms in preference to the semicolon. Here, however, we wish to emphasize that morphisms are to be thought of as relations, therefore we revert to the semicolon.
The universal covering got its name from a similar concept in the theory of Riemann surfaces.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Wien
About this chapter
Cite this chapter
Schmidt, G., Hattensperger, C., Winter, M. (1997). Heterogeneous Relation Algebra. In: Brink, C., Kahl, W., Schmidt, G. (eds) Relational Methods in Computer Science. Advances in Computing Sciences. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6510-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6510-2_3
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82971-4
Online ISBN: 978-3-7091-6510-2
eBook Packages: Springer Book Archive