In article <366476DE.788A61D1_at_webspace.com.au>,
"T.S.S." <tss_at_webspace.com.au> wrote:
> I would love to have a dynamic linked list structure, so that I can do
> some binary trees, etc,
> and I would love these to be within memory rather than database based
> (i.e. not resident within
> a tablespace somewhere). The only thing I really, really want, is to
> use the type in a select
> statement without having to use a function.
>
> The only things that would be ok are: Nested Tables, Varying Arrays, and
> Index-By Tables.
>
> But the problem with the first is that it has to be stored in the
> Database.
> The second has an upper limit and can't be used in a select statement.
> And the third cannot be used in a select statement (just like the
> second).
>
> Qu: Does anyone know if it is possible to have a dynamic array like
> structure that I can use
> within a select statement and that doesn't require being saved somewhere
> in the DB?
>
> T.S.S.
> 96 919 Fireblade
>
>
You can knock yourself out with the external procedures. It is possible
to write a C program and invoke it from PL/SQL. From what you are telling
us, it doesn't seem like a healthy realtional design.
Mladen Gogala
-----------== Posted via Deja News, The Discussion Network ==----------
http://www.dejanews.com/ Search, Read, Discuss, or Start Your Own
Received on Wed Dec 02 1998 - 14:08:29 CST
