mysql递归查询查不全_mysql递归查询(未分页版本)

本文提供了一个MySQL递归查询的实例,展示了如何通过存储过程查询具有层级结构的数据。使用临时表来递归地获取指定节点的所有子节点,并记录每个节点的深度。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

例子,mysql递归查询代码。

复制代码 代码示例:

DROP TABLE IF EXISTS `treenodes`;

CREATE TABLE `treenodes` (

`id` int(11) NOT NULL,

`nodename` varchar(20) DEFAULT NULL,

`pid` int(11) DEFAULT NULL,

PRIMARY KEY (`id`)

) ENGINE=InnoDB DEFAULT CHARSET=utf8;

-- ----------------------------

-- Records of treenodes

-- ----------------------------

INSERT INTO `treenodes` VALUES ('1', 'A', '0');

INSERT INTO `treenodes` VALUES ('2', 'B', '1');

INSERT INTO `treenodes` VALUES ('3', 'C', '1');

INSERT INTO `treenodes` VALUES ('4', 'D', '2');

INSERT INTO `treenodes` VALUES ('5', 'E', '2');

INSERT INTO `treenodes` VALUES ('6', 'F', '3');

INSERT INTO `treenodes` VALUES ('7', 'G', '6');

CREATE PROCEDURE showChildList (IN rootId INT,IN)

BEGIN

CREATE TEMPORARY TABLE IF NOT EXISTS tmpLst

(sno int primary key auto_increment,

id int,

depth int

);

DELETE FROM tmpLst;

CALL createChildLst(rootId,0);

select tmpLst.*,treeNodes.*

from tmpLst,treeNodes

where tmpLst.id = treeNodes.id

order by tmpLst.sno;

END;

CREATE PROCEDURE createChildLst (IN rootId INT,IN nDepth INT)

BEGIN

DECLARE done INT DEFAULT 0;

DECLARE b INT;

DECLARE cur1 CURSOR FOR SELECT id FROM treeNodes where pid=rootId;

DECLARE CONTINUE HANDLER FOR NOT FOUND SET done = 1;

insert into tmpLst values (null,rootId,nDepth);

OPEN cur1;

FETCH cur1 INTO b;

WHILE done=0 DO

CALL createChildLst(b,nDepth+1);

FETCH cur1 INTO b;

END WHILE;

CLOSE cur1;

END;

mysql> call showChildList(1);

+-----+----+-------+----+----------+-----+

| sno | id | depth | id | nodename | pid |

+-----+----+-------+----+----------+-----+

|   2 |  1 |     0 |  1 | A        |   0 |

|   3 |  2 |     1 |  2 | B        |   1 |

|   4 |  4 |     2 |  4 | D        |   2 |

|   5 |  5 |     2 |  5 | E        |   2 |

|   6 |  3 |     1 |  3 | C        |   1 |

|   7 |  6 |     2 |  6 | F        |   3 |

|   8 |  7 |     3 |  7 | G        |   6 |

+-----+----+-------+----+----------+-----+

7 rows in set

Query OK, 0 rows affected

mysql> call showChildList(3);

+-----+----+-------+----+----------+-----+

| sno | id | depth | id | nodename | pid |

+-----+----+-------+----+----------+-----+

|   9 |  3 |     0 |  3 | C        |   1 |

|  10 |  6 |     1 |  6 | F        |   3 |

|  11 |  7 |     2 |  7 | G        |   6 |

+-----+----+-------+----+----------+-----+

3 rows in set

Query OK, 0 rows affected

mysql> call showChildList(5);

+-----+----+-------+----+----------+-----+

| sno | id | depth | id | nodename | pid |

+-----+----+-------+----+----------+-----+

|  12 |  5 |     0 |  5 | E        |   2 |

+-----+----+-------+----+----------+-----+

1 row in set

Query OK, 0 rows affected

mysql递归查询替代函数实例

mysql递归查询树形叶子

MySQL 递归查询当前节点子节点

mysql递归查询实现方法

sql递归查询代码(cte应用)

sql2005递归查询的例子

sql递归查询(with cte实现)

sql 递归查询的代码(图文)

sql server 递归查询数据

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值