anyone have any ideas on how to write a recursive query given the following scenario:
given the structure:
item1
item1-1(parent item1)
item1-1-1 (parent item1-1)
item1-2(parent item1)
item2
item2-1(parent item2)
item2-2-1(parent item2-1)
etc..
basically the numbering is irrelevant, however i want to try to get all of the items below item 1 or item 2 where the tree can go N items deep.
as far as the db structure goes each record has the an item id and a parent item id. the top most item (item 1) will not have a parent.