Re: a union is always a join!
From: Brian Selzer <brian_at_selzer-software.com>
Date: Sat, 4 Apr 2009 20:06:36 -0400
Message-ID: <lwSBl.15013$8_3.13740_at_flpi147.ffdc.sbc.com>
Date: Sat, 4 Apr 2009 20:06:36 -0400
Message-ID: <lwSBl.15013$8_3.13740_at_flpi147.ffdc.sbc.com>
"rpost" <rpost_at_pcwin518.campus.tue.nl> wrote in message
news:gq8e2h$1ujr$1_at_mud.stack.nl...
> Brian Selzer wrote:
>
>>>> The mathematics of relational calculus and relational algebra are fully
>>>> capable, AFAIK, of describing the difference between two states of a
>>>> database.
>
> [...]
>
>>The algebra is capable of that if and only if each and every tuple has a
>>key
>>that permanently identifies the thing in the universe of discourse that
>>the
>>tuple maps to.
>
> No, the algebra can describe the difference between database states
> without any assumption on how these states are interpreted.
