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: Theory of Timeseries extensions to SQL and database

Re: Theory of Timeseries extensions to SQL and database

From: David <david.wynter_at_btclick.com>
Date: Tue, 29 Oct 2002 22:21:37 +0000 (UTC)
Message-ID: <apn1lg$448$1@sparta.btinternet.com>


Hi,

Click on http://www.sandtechnology.co.uk/products/index.html then Library then Nucleus Server Whitepaper. It is kind of hidden away.

I also had a read of some of their patents at uspto.gov. The approach they have relies heavily on the compression of the bit vector, it would be impractical without. Because they order their value tables for performance the update and insert operations will be reasonably expensive. Updating their encoded bit arrays should however be reasonably quick.

Any idea how a system that replaced the bit array with a hashtable might perform?

David

"Jan Hidders" <hidders_at_REMOVE.THIS.uia.ua.ac.be> wrote in message news:3dbd0d3f$1_at_news.uia.ac.be...
> --CELKO-- wrote:
> >
> >The real trick in Nucleus is that they compress the sparse matrix in such
a
> >way that they can query it in its compressed form. The fact that 'red'
is
> >the color of car "#12" in race (7) becomes one bit in a compressed 3D bit
> >space.
> >
> >[...]
> >
> >Click over and get their white papers for more details.
>
> Sounds very interesting. Do you know where these white papers are? They
talk
> about them on their web site, but I don't see any actual links.
>
> -- Jan Hidders
Received on Tue Oct 29 2002 - 16:21:37 CST

Original text of this message

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