Re: using a subquery/self-join to recursively retrieve a tree

2009-03-11 Thread Claudio Nanni
as you say you need recursion to build the tree from the table. if you are interested just in all the employees that are not manager with their manager info. select * from emp e1 inner join emp e2 on e1.uidman=e2.uid; cheers Claudio 2009/3/10 Ali, Saqib > Hello, > > I have following simp

Re: using a subquery/self-join to recursively retrieve a tree

2009-03-10 Thread Peter Brawley
How can I do some recursion to get the UIDs of all the employees reporting up to a manager, regardless of how deep the tree is. I can do this usindg LDAP and/or PHP, but not sure how to do it as a mysql query. Examples & discussion at http://www.artfulsoftware.com/mysqlbook/sampler/mysqled1ch20

using a subquery/self-join to recursively retrieve a tree

2009-03-10 Thread Ali, Saqib
Hello, I have following simplistic DB representing a hierarchy: ++--+--+-+-+---+ | Field | Type | Null | Key | Default | Extra | ++--+--+-+-+---+ | uid| int(10) | NO | PRI | 0 | | | nam