MySQL递归查询

简单递归

输出数字1到10

WITH RECURSIVE number_sequence AS (
  SELECT 1 AS num -- 初始条件
  UNION ALL
  SELECT num + 1 AS num FROM number_sequence WHERE num < 10 -- 递归条件,生成1到10的数字序列
)
SELECT num FROM number_sequence; -- 查询结果

源数据


CREATE TABLE department (
  id int PRIMARY KEY,
  name varchar(20),
  parent_id int
)

insert  into department(id, name, parent_id) values 
(1,'总部',NULL),
(2,'技术部',1),
(3,'开发部',2),
(4,'测试部',2),
(5,'销售部',1),
(6,'市场部',1);

在这里插入图片描述

向上递归

向上递归,查询自己的所有祖先

with recursive department_tree as (
select id, name, parent_id, 1 as recursion_level, cast(id as char(20)) as id_path 
from department where id = 4
union all
select d.id, d.name, d.parent_id, 
t.recursion_level+1 as recursion_level, concat(t.id_path, '->', d.id) as id_path 
from department_tree t, department d where t.parent_id = d.id
)
select * from department_tree

在这里插入图片描述

向下递归

向下递归,查询自己的所有子集

with recursive department_tree as (
select id, name, parent_id, 1 as recursion_level, cast(id as char(20)) as id_path 
from department where id = 1 
union all
select d.id, d.name, d.parent_id, 
t.recursion_level+1 as recursion_level, concat(t.id_path, '<-', d.id) as id_path 
from department_tree t, department d where d.parent_id = t.id
)
select * from department_tree

在这里插入图片描述

  • 5
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值