Comments on: Oracle 11gR2 – alternative for CONNECT_BY_ISLEAF function for Recursive Subquery Factoring (dedicated to Anton)

By: Lucas

Lucas — Wed, 18 Nov 2009 15:06:21 +0000

Is what you are asking for just the root node for every leaf-node – it seems that way at least. Of course it is easy to add the root to every node returned from the query and then filter on is_leaf = 1. Something like:

WITH
each_level (empid, name, mgrid, lev, root) AS
(
SELECT empno, ename, mgr , 1, ename
FROM emp
WHERE mgr is null
UNION ALL
SELECT empno, ename, mgr, lev+1, root
FROM each_level r, emp e
WHERE r.empid = e.mgr
)
SEARCH DEPTH FIRST BY mgrid SET seq
, leafNodes as
( select e.*
from each_level e
where case
when (lev – lead(lev) over (order by seq)) < 0
then 0
else 1
end = 1
)
select ename
, root top_manager
from leafNodes

Or are you looking for something else?

By: Anton Scheffer

Anton Scheffer — Mon, 16 Nov 2009 15:27:30 +0000

Of course I’m satisfied! But can you use it to find the topmanager from every employee? Something like:

select emp.empid
, emp.name
, ( select mgr.name
from emp mgr
where connect_by_isleaf = 1
connect by mgr.empid = prior mgr.mgr
start with mgr.empid = emp.mgr
) top_manager
from emp emp

By: Rob van Wijk

Rob van Wijk — Sat, 14 Nov 2009 09:51:21 +0000

Hi Lucas,

Brilliant idea! I just finished a session telling my audience there is no alternative for connect_by_isleaf. I’ll have to revise that statement …
By the way, cycle detection is still different from the connect-by syntax. Maybe you can even call it wrong but that’s subjective. And did you compare execution plans and performance? If you do, you’ll stick with connect-by. At least for some cases.

Regards,
Rob.