Re: double linked list

From: Mikito Harakiri <mikharakiri_at_yeehu.com>
Date: Sun, 02 Feb 2003 05:51:40 GMT
Message-ID: <Ml2%9.58105$to3.82811_at_rwcrnsc51.ops.asp.att.net>


"--CELKO--" <71062.1056_at_compuserve.com> wrote in message news:c0d87ec0.0302011323.6b6e9e7f_at_posting.google.com...
> >> Currently I figure to use
>
> SELECT cs, cb, level
> FROM link_t
> START WITH cb
> IN (SELECT cb
> FROM link_t
> WHERE cs = 'A')
> CONNECT BY PRIOR cb = cs;
>
> that will return a tree containing all paths with the root as the
> common starting point. <<
>
> It returns a sequential file that represents a table and that
> represernation depends on the order of the records (they are no
> longer rows in a table).

Looks like we won't see a "connect-by" chapter in your book;-)

In addition to

http://groups.google.com/groups?hl=en&lr=&ie=UTF-8&oe=UTF-8&selm=bdf69bdf.02 08011026.9caa07a%40posting.google.com

I would mention that there is a striking syntactic and semantic similarity between "connect-by" and "group-by"... Received on Sun Feb 02 2003 - 06:51:40 CET

Original text of this message