Re: Theory of Timeseries extensions to SQL and database
Date: Sun, 3 Nov 2002 19:43:19 -0500
Message-ID: <xrjx9.127$nI1.38570054_at_radon.golden.net>
David,
You need to understand the difference between logical representation
(relations) and physical storage (hashes, heaps, b+tree indexes, ISAM,
r-tree, clustering, partitioning, etc.)
A good dbms will allow you to manipulate the data exactly the same (ie.
using relations) regardless of how it physically stores the data. From what
I understand, kdb is actually a good example of how this is possible;
although, I also understand they make the mistake of polluting the logical
data model with arrays.
Cheers,
"David" <david.wynter_at_btclick.com> wrote in message
news:apbre3$68e$1_at_venus.btinternet.com...
Bob
> Hi,
>
> I did a Google search on timeseries and database and found some research
> called Sorted Relational Query Language. Also SQL-TS. I have a few
questions
> beyond what I found.
>
> Does anyone know where there is reseach on the method of storing columns
> instead of relations, called inversion I believe? What I am after is an
> understanding of the techniques available to manipulate (i.e. query
against)
> result sets as big as a 500,000*5,000 matrix of a 2 element aray
containing
> a unique identifier and a numeric value that would perform very fast.
>
> Are there any are there any implementations of SRQL or SQL-TS?
>
> Thanks
>
> David
>
>
>
>
Received on Mon Nov 04 2002 - 01:43:19 CET