BOM树形节点展开实例

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

-- Author : htl258(Tony)

-- Date   : 2009-07-30 17:19:15

-- Version: Microsoft SQL Server 2008 (RTM) - 10.0.1600.22 (Intel X86)

--          Jul  9 2008 14:43:34

--          Copyright (c) 1988-2008 Microsoft Corporation

--          Developer Edition on Windows NT 5.1 <X86> (Build 2600: Service Pack 2)

-- Blog   : http://blog.csdn.net/htl258

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

 

--> 生成测试数据表:tree

 

IF NOT OBJECT_ID('[tree]') IS NULL

    DROP TABLE [tree]

GO

CREATE TABLE [tree]

(

    [id] INT, [pid] INT,

    [name] NVARCHAR(3)

)

INSERT tree

SELECT 1, 1, 'A' UNION ALL

SELECT 2, 2, 'B' UNION ALL

SELECT 11, 1, 'AA' UNION ALL

SELECT 111, 11, 'AAA' UNION ALL

SELECT 22, 2, 'BB' UNION ALL

SELECT 33, 2, 'CC' UNION ALL

SELECT 44, 11, 'DDD' UNION ALL

SELECT 55, 1, 'EE'

GO

--Select * from tree

 

-->SQL查询如下:

;WITH t AS

(

    SELECT *,CAST(id AS VARBINARY) AS px,lvl=0

    FROM [tree] AS A

    WHERE NOT EXISTS(

              SELECT *

              FROM [tree]

              WHERE id = A.pid

                  AND id <> A.id

          )

    UNION ALL

    SELECT A.*,CAST(px+CAST(a.id AS VARBINARY) AS VARBINARY),lvl+1

    FROM [tree] AS A

    JOIN t AS B

        ON CASE a.pid

                WHEN a.id THEN 0

                ELSE a.pid

           END=b.id

 

)

SELECT REPLICATE('-', lvl)+name AS name

FROM t

ORDER BY px;

/*

name

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

A

-AA

--DDD

--AAA

-EE

B

-BB

-CC

 

(8 行受影响)

*/

   

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值