chrisacron wrote:

> I had thought of that but wouldn't a recursive stored procedure incur
> an even bigger overhead? As each level fires a select statement that
> has to run for each row returned?

If you have proper indexes, no. Besides, stored procedure would only go
to the required depth, so it would be much, much faster on "short" tree
branches which only go few nodes deep.

--
Milan Babuskov
http://swoes.blogspot.com/
http://www.flamerobin.org