Oracle 中实现查找树形结构节点功能
2017-10-18 00:00
513 查看
这个方法只是对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
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
相关文章推荐
- Oracle 中实现查找树形结构节点功能
- Oracle 查找树形结构当前节点下所有子孙节点
- oracle查询出树形结构的表,父节点数据是子节点的数据和
- thinkphp5带分组功能的树形结构的无限级分类节点展示
- MySQL使用递归存储过程实现树状结构,实现Oracle的Connect By 功能
- C#实现树型结构TreeView节点拖拽的简单功能(转)
- 利用QtQuick 2.0(qml)实现叶子节点可以拖动的强大的树形结构
- 医院管理系统(实现功能:浏览医院的整体结构,给定任意节点输出该节点信息就子节点信息,计算在给出点之间的“病房的数量”)
- Java 数据结构之一般树形结构中父节点和子节点的查找
- 取出所有树形结构父节点下的子节点(用存储过程实现)
- 【079】利用“剪叶子”算法实现树形结构的搜索功能,用Vue.js实现
- Oracle Form开发手电筒查找功能实现
- C#实现树型结构TreeView节点拖拽的简单功能,附全部源码,供有需要的参考
- oracle树形结构由子节点递归得到父节点
- Oracle Form开发手电筒查找功能实现
- 递归删除树形结构的所有子节点(java和mysql实现)
- GridView中实现树形结构分组的功能
- Oracle 层级语句 树形结构 显示根节点 不显示根节点
- MySql的sql语句中添加存储过程或者存储函数来实现Oracle中的start with ……connect by prior……递归(树形结构数据)查询
- Java递归实现删除树形结构的任一节点