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: paul c <toledobythesea_at_oohay.ac>
Date: Thu, 03 May 2007 07:36:00 GMT
Message-ID: <Ahg_h.156338$6m4.76752@pd7urf1no> 





Jon Heggland wrote:


> paul c wrote:

> 


>>I certainly do.  RT isn't as complicated or subtle as this thread is
>>making it out to be.  Relvars are nothing more a language device (as are
>>dbvars), for talking about relations, whether the language is D or
>>English.  They merely serve to save us enumerating a relation everytime
>>we refer to it.




> 

> 

> I think this is oversimplifying. Constraints are associated with

> variables, so we need the variables for something more than value aliases.

> ...




Hadn't thought of that, perhaps it is so, I'm not sure yet.  Still 
thinking of a constraint as an expression that produces a value from one 
or more others.



p
Received on Thu May 03 2007 - 02:36:00 CDT












Original text of this message













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