Re: Logical equivalence of simple and complex types under the relational model?

From: Alfredo Novoa <>
Date: Thu, 02 Dec 2004 11:52:19 GMT
Message-ID: <>

On Wed, 01 Dec 2004 22:58:41 +0000, Paul <> wrote:

>I think what he means is that the components are nondecomposable by
>relational operators as opposed to type operators.

Relational operators are type operators. But what about tuple operators, array operators, list operators, etc?

You are calling atomic to all non relational values.

Regards Received on Thu Dec 02 2004 - 12:52:19 CET

Original text of this message