Re: Reminder, blatant ad
- From: Jon Heggland <heggland@xxxxxxxxxxx>
- Date: Fri, 27 Jan 2006 22:07:42 +0100
In article <1138380152.680513.293150@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
jog@xxxxxxxxxxxxx says...
> Jan Hidders wrote:
> [snip]
> I do not agree with this. Conventional ordering (and hence listing) is
> mathematically impossible in the relational model period, due to the
> Codd's redefinition of RM-relations and the model's closure.
Can you elaborate on this? I can't immediately see why lists are harder
than arrays, special cases of which even today's SQL systems can handle.
> Dawn is
> hence correct imo - lists must be interpreted by a process external to
> the RM, not for the sake of simplicity, or query optimization, but
> rather because the very the nature of that data model precludes their
> implementation.
....though of course if you view the type system as "external to the RM",
you are correct---but I don't really see the point of the argument in
that case.
--
Jon
.
- References:
- Reminder, blatant ad
- From: dawn
- Re: Reminder, blatant ad
- From: Jan Hidders
- Re: Reminder, blatant ad
- From: dawn
- Re: Reminder, blatant ad
- From: Jan Hidders
- Re: Reminder, blatant ad
- From: JOG
- Reminder, blatant ad
- Prev by Date: Re: modeling either/or relationship...
- Next by Date: Re: Reminder, blatant ad
- Previous by thread: Re: Reminder, blatant ad
- Next by thread: Re: Reminder, blatant ad
- Index(es):