Oracle 中实现查找树形结构节点功能

这个方法只是对Oracle10以上才有效,对sqlserver、mysql没有测试

select connect_by_isleaf isleaf,
            tb.switch_type_id,
            sys_connect_by_path(tb.package_id, '|') path,
            tb.record_type,
            tb.element_offset,
            tb.element_length,
            tb.element_encode_type,
            tb.element_align,
            tb.mask,
            tb.asn_type
            from (select b.switch_type_id,
                    b.package_id,
                    b.element_offset,
                    b.element_length,
                    b.element_encode_type,
                    nvl(b.element_align, 'L') element_align,
                    b.record_type,
                    nvl(b.mask, 'LH') mask,
                    b.asn_type,
                    b.switch_type_id || '|' || b.package_level || '|' || b.package_id level_child,
                    b.switch_type_id || '|' || (b.package_level - 1) || '|' || b.parent_package_id level_parent
                 from switch_asn_record b
                 ) tb
             start with tb.level_parent like '%|0|-1'
             connect by prior tb.level_child = tb.level_parent;

1、connect_by_isleaf是否是子节点;
2、sys_connect_by_path(tb.package_id, '|')   ==>  |xxx|xxx|xxx
3、start with tb.level_parent like '%|0|-1'  ==> 树的遍历以从什么开始
4、connect by prior tb.level_child = tb.level_parent;  ==>此层遍历之后,再将child作为parent,继续往下遍历

 

 

 

select t.*, t.rowid from tbgm_goods_category t

--递归查出指定ID的所有上级节点
SELECT LPAD('',2*(LEVEL - 1), '') || gc.category_id AS category_id,gc.trade_id,gc.parent_category_id

  FROM tbgm_goods_category gc

  CONNECT BY PRIOR parent_category_id = category_id -- 找出所有DEPT_ID等于当前记录PARENT_ID的记录

  START WITH category_id = 216              -- 从部门4开始递归查询。


--递归查出指定ID的所有子级节点
SELECT LPAD('',2*(LEVEL - 1), '')||gc.category_id AS category_id,gc.trade_id,gc.parent_category_id,gc.category_depth

  FROM tbgm_goods_category gc
         where category_depth <= (SELECT category_depth FROM tbgm_goods_category where category_id = 214)+1
  CONNECT BY parent_category_id = PRIOR category_id -- 找出所有PARENT_ID等于当前记录DEPT_ID的记录。

  START WITH category_id = 214          -- 从部门2开始递归查询。
   
  

 

oracle 9I中查找一个节点的所有制叶子节点
select
  max(t.parent_category_id)keep(dense_rank last order by level)p,
  max(t.category_id)keep(dense_rank last order by level)c,
  max(t.category_name)keep(dense_rank last order by level)n
from tbgm_goods_category t
start with t.parent_category_id=259
connect by prior t.category_id=t.parent_category_id
--and prior child_type=/'special/'
group by rownum-level

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值