Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: A new proof of the superiority of set oriented approaches: numerical/time serie linear interpolation

Re: A new proof of the superiority of set oriented approaches: numerical/time serie linear interpolation

From: Cimode <cimode_at_hotmail.com>
Date: 5 May 2007 12:54:48 -0700
Message-ID: <1178394888.610941.137490@p77g2000hsh.googlegroups.com>


On 5 mai, 21:31, "Brian Selzer" <b..._at_selzer-software.com> wrote:
> "Cimode" <cim..._at_hotmail.com> wrote in message
[Snipped]
> Short of that, I don't think you can avoid both nulls and logical
> decomposition. Even with a derived relation, there has to be something from
> which it is derived.

Brian,

Sorry but I was not refering to the logical model but rather to a computing model required for representing relations. They are separate concepts. But thanks for bringing your insight.
> [snip]
Received on Sat May 05 2007 - 14:54:48 CDT

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US