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=arch...@jab.org
