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 <docbook.xml@stripped>
> Hello,
>
> I have following simplistic DB representing a hierarchy:
>
> +------------+----------+------+-----+---------+-------+
> | Field | Type | Null | Key | Default | Extra |
> +------------+----------+------+-----+---------+-------+
> | uid | int(10) | NO | PRI | 0 | |
> | name | char(80) | YES | | NULL | |
> | mail | char(80) | YES | | NULL | |
> | manageruid | int(10) | YES | | NULL | |
> +------------+----------+------+-----+---------+-------+
>
> 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.
>
> Any thoughts? Thanks
>
> saqib
> http://www.capital-punishment.us
>
> --
> MySQL General Mailing List
> For list archives: http://lists.mysql.com/mysql
> To unsubscribe:
> http://lists.mysql.com/mysql?unsub=1
>
>
