> -Original Message-
> From: [EMAIL PROTECTED]
> [mailto:[EMAIL PROTECTED] On Behalf Of
> [EMAIL PROTECTED]
> Sent: Tuesday, May 09, 2006 1:51 AM
> To: pgsql-general@postgresql.org
> Subject: Re: [GENERAL] Google Summer of Code: Full Disjunctions
>
> >
> 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 Lee,
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
f
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 above
ECTED] On Behalf Of Tom Lane
> Sent: Saturday, May 06, 2006 12:26 AM
> To: Tzahi Fadida
> Cc: pgsql-general@postgresql.org
> Subject: Re: [GENERAL] Google Summer of Code: Full Disjunctions
>
> "Tzahi Fadida" <[EMAIL PROTECTED]> writes:
> > The output of
"Tzahi Fadida" <[EMAIL PROTECTED]> writes:
> The output of the full disjunctions FD(A,B,C):
> FD
> X Y Z
> a | b | c
> a | b | d
> This output cannot be generated using standard SQL statements.
Does anybody care? Your example looks to me like nothing but a poorly
de
A little self advertising:
Here is a link to my proposal that was sent to google:
http://www.technion.ac.il/~tzahi/proposal.txt
Full Disjunction is an operator.
Without any long introductions (see link above)...
An excerpt:
Example of an input and output of a full disjunctions:
A
