trees, WITH operator, and traversal

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.

thanks,
robert young Received on Fri Dec 28 2001 - 15:21:02 CET