First, i have no knowledge of anyone that have implemented full
disjunctions(ever) aside
from the theoretical works of my colleagues.
With the exception of a corner case of it, that I believe was a simulation in
96.
(A. Rajaman and J.D. Ullman Integrating information by outerjoins and
Hi Tzahi
Since you seem to know about full disjunctions, I was wondering if you
could answer this question:
Can full disjunction be implemented as a binary operator?
The algorithms I've seen for computing it seem to require that all
input relations be supplied at once. Even in your message
