create table treeNodes
(
id int primary key,
nodename varchar(20),
pid int
);CREATE FUNCTION `getChildLst`(rootId INT)
RETURNS varchar(1000)
BEGIN
DECLARE sTemp VARCHAR(1000);
DECLARE sTempChd VARCHAR(1000);
SET sTemp = '$';
SET sTempChd =cast(rootId as CHAR);
WHILE sTempChd is not null DO
SET sTemp = concat(sTemp,',',sTempChd);
SELECT group_concat(id) INTO sTempChd FROM treeNodes where FIND_IN_SET(pid,sTempChd)>0;
END WHILE;
RETURN sTemp;
END
这个是查出所有子节点id $,1,2,3,4,5,6,7
我想要查出所有父辈节点id ,深度为10 (就是只查10个父辈节点),如果超过10个后面的就不查不来
删除结果 '1','2','3','4'
(
id int primary key,
nodename varchar(20),
pid int
);CREATE FUNCTION `getChildLst`(rootId INT)
RETURNS varchar(1000)
BEGIN
DECLARE sTemp VARCHAR(1000);
DECLARE sTempChd VARCHAR(1000);
SET sTemp = '$';
SET sTempChd =cast(rootId as CHAR);
WHILE sTempChd is not null DO
SET sTemp = concat(sTemp,',',sTempChd);
SELECT group_concat(id) INTO sTempChd FROM treeNodes where FIND_IN_SET(pid,sTempChd)>0;
END WHILE;
RETURN sTemp;
END
这个是查出所有子节点id $,1,2,3,4,5,6,7
我想要查出所有父辈节点id ,深度为10 (就是只查10个父辈节点),如果超过10个后面的就不查不来
删除结果 '1','2','3','4'
建议你列出你的表结构,并提供测试数据以及基于这些测试数据的所对应正确结果。
参考一下这个贴子的提问方式http://topic.csdn.net/u/20091130/20/8343ee6a-417c-4c2d-9415-fa46604a00cf.html
1. 你的 create table xxx .. 语句
2. 你的 insert into xxx ... 语句
3. 结果是什么样,(并给以简单的算法描述)
4. 你用的数据库名称和版本(经常有人在MS SQL server版问 MySQL)
这样想帮你的人可以直接搭建和你相同的环境,并在给出方案前进行测试,避免文字描述理解上的误差。
(
id int primary key,
nodename varchar(20),
pid int
);INSERT INTO `treenodes` VALUES (20, 'book20', 19);
INSERT INTO `treenodes` VALUES (19, 'book19', 18);
INSERT INTO `treenodes` VALUES (18, 'book18', 17);
INSERT INTO `treenodes` VALUES (17, 'book17', 15);
INSERT INTO `treenodes` VALUES (16, 'book16', 15);
INSERT INTO `treenodes` VALUES (15, 'book15', 12);
INSERT INTO `treenodes` VALUES (14, 'book14', 12);
INSERT INTO `treenodes` VALUES (13, 'book13', 9);
INSERT INTO `treenodes` VALUES (12, 'book12', 9);
INSERT INTO `treenodes` VALUES (11, 'book11', 8);
INSERT INTO `treenodes` VALUES (10, 'book10', 8);
INSERT INTO `treenodes` VALUES (9, 'book9', 8);
INSERT INTO `treenodes` VALUES (8, 'book8', 7);
INSERT INTO `treenodes` VALUES (7, 'book7', 5);
INSERT INTO `treenodes` VALUES (6, 'book6', 2);
INSERT INTO `treenodes` VALUES (5, 'book5', 2);
INSERT INTO `treenodes` VALUES (4, 'book4', 1);
INSERT INTO `treenodes` VALUES (3, 'book3', 1);
INSERT INTO `treenodes` VALUES (2, 'book2', 1);
INSERT INTO `treenodes` VALUES (1, 'book1', 0);节点20 的父辈节点有 19,18,17,15,12,9,8,7,5,2,1
根据子节点知道上面父辈节点 只要十个以下 超过十个不显示
根据 前台传来的20id 我只要上面十个父辈节点 也就是 1排除
要得到这样的结果 : '19','18','17','15','12','9','8','7','5','2'
+----+----------+------+
| id | nodename | pid |
+----+----------+------+
| 1 | book1 | 0 |
| 2 | book2 | 1 |
| 3 | book3 | 1 |
| 4 | book4 | 1 |
| 5 | book5 | 2 |
| 6 | book6 | 2 |
| 7 | book7 | 5 |
| 8 | book8 | 7 |
| 9 | book9 | 8 |
| 10 | book10 | 8 |
| 11 | book11 | 8 |
| 12 | book12 | 9 |
| 13 | book13 | 9 |
| 14 | book14 | 12 |
| 15 | book15 | 12 |
| 16 | book16 | 15 |
| 17 | book17 | 15 |
| 18 | book18 | 17 |
| 19 | book19 | 18 |
| 20 | book20 | 19 |
+----+----------+------+
20 rows in set (0.00 sec)mysql> delimiter //
mysql> CREATE FUNCTION `getParentLst`(ChildId INT)
-> RETURNS varchar(1000)
-> DETERMINISTIC
-> BEGIN
-> DECLARE sTemp VARCHAR(1000) default '';
-> DECLARE vID INT;
-> DECLARE iCnt INT default 0;
->
-> set vID = ChildId;
-> REPEAT
-> select pid into vID from treenodes where id=vID;
-> if FOUND_ROWS() then
-> set sTemp=concat(sTemp,'\'',vID,'\',');
-> set iCnt=iCnt+1;
-> end if;
-> UNTIL not FOUND_ROWS() or iCnt>=10 END REPEAT;
-> if length(sTemp)>1 then
-> set sTemp=left(sTemp,length(sTemp)-1);
-> end if;
-> RETURN sTemp;
-> END//
Query OK, 0 rows affected (0.00 sec)mysql> delimiter ;
mysql>
mysql> select getParentLst(20);
+----------------------------------------------+
| getParentLst(20) |
+----------------------------------------------+
| '19','18','17','15','12','9','8','7','5','2' |
+----------------------------------------------+
1 row in set (0.00 sec)mysql>