Hi, I'm actually new to this forum, and I decided to post here after seeing something in the archives regarding recursive SQL, but the function was in PL/PgSQL, and was just has taxing query-wise as doing it from C or even Perl.
I'm working with a bit of a 'trouble' dataset, in that:
Now, i need to grab an arbitrary level of the root parent's children, meaning:
If I wanted to go two levels, I would need to find the Children of "AAA" and the children of all of "AAA"s children, whereas one level down would just be "AAA"s children.
Any thoughts on how I could do this without looping through each result in PL/PgSQL, and calling the function again for each result? (in reference to <a href="http://www.dbforums.com/t950413.html" this thread</a>)