gpt4 book ai didi

MySQL查询父子关系

转载 作者:行者123 更新时间:2023-11-29 05:31:41 25 4
gpt4 key购买 nike

我想编写一个选择查询来获取从子级到父级的完整路径:

| Unique Id | Child Code | Parent Code |
| X | 9 | 7 |
| Y | 7 | 6 |
| Z | 6 | 5 |
| A | 5 | NULL |
| B | 11 | 33 |
| C | 33 | 22 |
| D | 22 | NULL |

如果选择的代码是 9,则查询应返回其所有父代作为结果:9-7-6-5....

如果选择的代码是 11,则查询应返回:11-33-22....

谢谢。

最佳答案

试试这个查询

SELECT *
FROM (
SELECT
@r AS _id,
(SELECT @r := parent_code FROM mytable WHERE unique_id = _id) AS parent_id,
@l := @l + 1 AS lvl
FROM
(SELECT @r := 9, @l := 0) vars,
mytable m
WHERE @r <> 0) T1
JOIN mytable T2
ON T1._id = T2.id
ORDER BY T1.lvl DESC;

关于MySQL查询父子关系,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/14153024/

25 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com