2-pass TPMMS algorithm for ∪
B
Bag Union ∪
B
Fact:
There is
no need
for a
2-pass algorithm
for
∪
B
because the
memory requirement
of the
one
-pass algorithm
for
∪
B
is:
M ≥ 1 buffer
See:
click here
There is
no way
you can do
better
than
that
....