Reputation: 1792
I want to get branch from parent_id = null
to childs with given child ids
select *
from company s
start with s.parent_id is null and s.id = 56
connect by prior s.id = s.parent_id
result is full branch with element id: 56
How to select branch with chosen childs
Example:
Now result is:
id parent_id
56 null
57 56
58 57
59 57
60 56
61 60
what i want to acheieve is with given child id: 57 select only that branch
id parent_id
56 null
57 56
58 57
59 57
without not given child id:
60 56
61 60
Upvotes: 0
Views: 408
Reputation: 639
Some simple query, that should meet your requirements:
EDIT: Comments added in query
EDIT2: Minimised the SYS_CONNECT_BY_PATH usage so it was harder to reach it's size limit.
WITH param AS -- this is just our parameter to be used in further subqueries (ID and regex pattern for regexp_like expression)
(
SELECT
57 AS id
,'(\s?)('||57||')(\s|\W)' AS regex
FROM
dual
)
, parent AS -- here we get the inverted hierarchy - searching for the root node of the branch where ID given as parameter exists
(
SELECT
s.*
FROM
company s
,param
CONNECT BY PRIOR s.parent_id = s.id
START WITH s.id = param.id
)
, children AS -- here we get all the children of the root node we found in parent subquery
(
SELECT
s.*
,CASE
WHEN LEVEL >= MAX(CASE WHEN s.id = param.id THEN LEVEL ELSE NULL END) OVER (PARTITION BY NULL) THEN
SYS_CONNECT_BY_PATH(s.id,' ')
ELSE NULL
END AS path -- this gives us the hierarchical path
,LEVEL AS lvl -- this gives us children's levels
,MAX(CASE WHEN s.id = param.id THEN LEVEL ELSE NULL END) OVER (PARTITION BY NULL) AS id_level -- this gives the level of the children given as a parameter
FROM
company s
,param
CONNECT BY PRIOR s.id = s.parent_id
START WITH s.id = (SELECT parent.id FROM parent WHERE parent.parent_id IS NULL)
)
-- now we select from the all children hierarchy our desired branch
SELECT
c.*
FROM
children c
,param
WHERE
1 = CASE WHEN lvl > c.id_level AND REGEXP_LIKE(c.path, param.regex) THEN 1 -- if current id is of higher level (is a child of our paremeter ID), it must have our parameter ID in it's path
WHEN lvl = c.id_level AND c.id = param.id THEN 1 -- if the level is equal to our parameter's ID's leve, it has to be our paremeter
WHEN lvl < c.id_level AND EXISTS(SELECT 1 FROM parent WHERE parent.id = c.id) THEN 1 -- if current level is lower (may be a parent of our parmeter ID) it has to exists in the reverse hierarchy (thus, must be a parent or grandparent etc. of our paremter node)
ELSE 0
END
Btw. After having read Carlo Sirna's solution, I find his being a better one :)
Upvotes: 0
Reputation: 1251
This one works for any possible depth of the tree and is not using regexps or string concatenation. it should be easy to understand:
with
all_children_of_57 as
(
-- all nodes that can be reached by starting a recursive descent from node 57
select id
from company s
start with s.id = 57
connect by prior s.id = s.parent_id
),
all_ancestors_of_57 as
(
-- all ANCESTORS that can be reached by walking up the tree (FROM CHILD TO PARENT),
-- starting from node 57 (this is a linear recursion)
select id
from company s
start with s.id = 57
connect by s.id = prior s.parent_id
),
nodes_in_branch as
(
-- we are interested only in nodes extracted from the above two queries
select *
from company
where id in (select id from all_children_of_57)
or id in (select id from all_ancestors_of_57)
)
-- we do the recursion on the result of nodes_in_branch
select *
from nodes_in_branch s
start with s.parent_id is null
connect by prior s.id = s.parent_id
Upvotes: 2