欢迎您访问程序员文章站本站旨在为大家提供分享程序员计算机编程知识!
您现在的位置是: 首页  >  数据库

MySQL 递归排序查询+树节点生成

程序员文章站 2022-04-20 11:19:18
...

mysql 递归排序查询 备注:producttype 排序表,producttype。ptype父节点 ,producttype 。id 主键,showTreeNodes (IN rooti

mysql 递归排序查询

备注:producttype 排序表,producttype。ptype父节点 ,producttype 。id 主键,showTreeNodes (IN rootid INT) 函数,,参数为起始类型rootid.

drop PROCEDURE IF EXISTS showTreeNodes;

CREATE PROCEDURE showTreeNodes (IN rootid INT)
BEGIN
DECLARE Level int ;
drop TABLE IF EXISTS tmpLst;
CREATE TABLE tmpLst (
id int,
nLevel int,
sCort varchar(8000)
);
Set Level=0 ;
INSERT into tmpLst SELECT id,Level,ID FROM producttype WHERE ptype=rootid;
WHILE ROW_COUNT()>0 DO
SET Level=Level+1 ;
INSERT into tmpLst
SELECT A.ID,Level,concat(B.sCort,A.ID) FROM producttype A,tmpLst B
WHERE A.ptype=B.ID AND B.nLevel=Level-1 ;
END WHILE;
END;
CALL showTreeNodes(-1);

SELECT concat(SPACE(B.nLevel*2),'┕',A.name)
FROM producttype A,tmpLst B
WHERE A.ID=B.ID
ORDER BY B.sCort;

MySQL 递归排序查询+树节点生成