35
Relational Algebra Operations
(cont)
Set operations involve two relations
r(R), s(R)
(union-compatible)
Union
r
1
∪ r
2
= {
t
|
t ∈ r
1
∨ t ∈ r
2
}, where
r
1
(R), r
2
(R)
Computational view:
result
=
r
1
for each tuple
t
in relation
r
2
result
=
result ∪ {t}