Re: trees, WITH operator, and traversal

On 28 Dec 2001 06:21:02 -0800, gnuoytr_at_rcn.com (robert) wrote:

>referencing mr. celko's "sql for smarties" 2nd; #28.7.3, db2 WITH
>operator and fig. 29.2, tree diagram. given data that successive
>nodes are A, C, H (stored in a temporary table, the context is jdbc so
>host variable manipulation is not facile); is there a sql statement
>which returns K, L? all of the examples i've seen on the general
>subject show how to return all the child nodes from a given node.
>what i need is to traverse a tree through a given set of node
>identifiers. the context is the (in)famous One True Lookup Table
>problem.

For those who do not have the book:

A is the parent of C, C is the parent of H, H is the parent of K and L

A and C have other children as well.

It is not clear to me what your problem is. Could you perhaps state more precisely:

1. What exactly is known by the nodes in the temporary table?
2. What exactly characterises the nodes you want to select, in relation to the nodes in the temporary table?

-- 
Nis Jorgensen
Amsterdam

Please include only relevant quotes, and reply below the quoted text. Thanks