更新时间:2023-02-05 13:49:50
由于您只有4个级别,因此您不需要递归(尽管使用MS SQL CTE这样会很方便)./p>
类似的东西:
SELECT
t4.uid as child,
--t3.uid as parent,
--t2.uid as grand_parent,
--t1.uid as great_grand_parent,
t1.parentid as great_great_grand_parent
FROM
your_table_name t1
inner join your_table_name t2
on t2.parentid = t1.uid
inner join your_table_name t3
on t3.parentid = t2.uid
inner join your_table_name t4
on t4.parentid = t3.uin
where
t4.uid = '10007' -- your start node.
如果您需要对多个节点执行此操作,则需要将其加入到选择起始节点的对象中,或者例如将上面的WHERE t4.uid = '10007'
子句替换为WHERE t4.uid IN (SELECT DISTINCT uid FROM your_table_name)
这是徒手完成的,因此对错别字表示歉意.
I have a table which is like the following.
parentid uid
10001 10001
10001 10002
10001 10003
10002 10004
10004 10005
10003 10006
10005 10007
I need to establish the parent child relationship between rows in this single table.
I need to get the parent in the reverse order till 4 levels. For example the last record is uid 10007 whose parentid is 10005. Now uid 10005's parent is 10004 and 10004's parent is 10002 and 10002's parent is 10001.
I am using MySQL so recursion seems to be not possible. What are the options that I have and how do I address this multi-level issue. I use PHP/MySQL.
Thanks in advance guys.
Since you have a finite 4 levels, you shouldn't need recursion (although it'd be handy to be able to use eg MS SQL CTEs).
Something like:
SELECT
t4.uid as child,
--t3.uid as parent,
--t2.uid as grand_parent,
--t1.uid as great_grand_parent,
t1.parentid as great_great_grand_parent
FROM
your_table_name t1
inner join your_table_name t2
on t2.parentid = t1.uid
inner join your_table_name t3
on t3.parentid = t2.uid
inner join your_table_name t4
on t4.parentid = t3.uin
where
t4.uid = '10007' -- your start node.
If you need to do this for multiple nodes, you'd need to join this to something that selects your start nodes, or eg replace the above WHERE t4.uid = '10007'
clause to be WHERE t4.uid IN (SELECT DISTINCT uid FROM your_table_name)
This was done freehand so apologies for typos.