oracle 層次查詢判斷葉子和根節點

阿新 • • 發佈：2018-12-21

oracle 9i判斷是葉子或根節點，是比較麻煩的一件事情，SQL演示指令碼如下:

DROPTABLE idb_hierarchical;
createTABLE idb_hierarchical
(
id number,
parent_id number,
str varchar2(10)
);
insertinto idb_hierarchical values(1,null,'A');
insertinto idb_hierarchical values(2,1,'B');
insertinto idb_hierarchical values(3,2,'C');
insert

into idb_hierarchical values(4,3,'D');
insertinto idb_hierarchical values(5,2,'E');
insertinto idb_hierarchical values(6,2,'F');
insertinto idb_hierarchical values(7,3,'G');
insertinto idb_hierarchical values(8,4,'H');
insertinto idb_hierarchical values(9,4,'I');
insertinto idb_hierarchical values

(10,null,'J');
insertinto idb_hierarchical values(11,10,'K');
insertinto idb_hierarchical values(12,11,'L');
insertinto idb_hierarchical values(13,10,'M');

DROP TABLE idb_hierarchical;create TABLE idb_hierarchical(id number,parent_id number,str varchar2(10));insert into idb_hierarchical values(1,null 
,'A');insert into idb_hierarchical values(2,1,'B');insert into idb_hierarchical values(3,2,'C');insert into idb_hierarchical values(4,3,'D');insert into idb_hierarchical values(5,2,'E');insert into idb_hierarchical values(6,2,'F');insert into idb_hierarchical values(7,3,'G');insert into idb_hierarchical values(8,4,'H');insert into idb_hierarchical values(9,4,'I');insert into idb_hierarchical values(10,null,'J');insert into idb_hierarchical values(11,10,'K');insert into idb_hierarchical values(12,11,'L');insert into idb_hierarchical values(13,10,'M');

示例資料清單如下:

SELECT RPAD('+',LEVEL*2+1,'.')||STR STR_LEVEL,ID,PARENT_ID,LEVEL LVL
FROM idb_hierarchical
START WITH PARENT_ID ISNULL
CONNECTBY PARENT_ID = PRIOR ID;

SELECT RPAD('+',LEVEL*2+1,'.')||STR STR_LEVEL,ID,PARENT_ID,LEVEL LVL  FROM idb_hierarchical START WITH PARENT_ID IS NULLCONNECT BY PARENT_ID = PRIOR ID;

表1:資料清單
STR_LEVEL	ID	PARENT_ID	LVL
+..A	1	1
+….B	2	1	2
+……C	3	2	3
+……..D	4	3	4
+……….H	8	4	5
+……….I	9	4	5
+……..G	7	3	4
+……E	5	2	3
+……F	6	2	3
+..J	10	1
+….K	11	10	2
+……L	12	11	3
+….M	13	10	2

在表1中，ID為8、9、 7、5、6、12、13都沒有子節點，因此稱為葉節點。

1.oracle9i 查詢葉節點

只顯示葉子節點SQL

SELECT RPAD('+',LEVEL*2+1,'.')||STR STR_LEVEL,ID,PARENT_ID,LEVEL LVL
FROM idb_hierarchical I
--在oracle 9i中顯示葉節點，需要判斷是否有子節點即可
WHERENOT EXISTS(SELECT 1
FROM idb_hierarchical B
WHERE I.ID=B.PARENT_ID)
START WITH PARENT_ID ISNULL
CONNECTBY PARENT_ID = PRIOR ID;

SELECT RPAD('+',LEVEL*2+1,'.')||STR STR_LEVEL,ID,PARENT_ID,LEVEL LVL  FROM idb_hierarchical I  --在oracle 9i中顯示葉節點，需要判斷是否有子節點即可  WHERE NOT EXISTS(SELECT 1  FROM idb_hierarchical B  WHERE I.ID=B.PARENT_ID) START WITH PARENT_ID IS NULLCONNECT BY PARENT_ID = PRIOR ID;

表2
STR_LEVEL	ID	PARENT_ID	LVL
+……….H	8	4	5
+……….I	9	4	5
+……..G	7	3	4
+……E	5	2	3
+……F	6	2	3
+……L	12	11	3
+….M	13	10	2

顯示所有節點，標明該行是否為葉節點SQL

SELECT RPAD('+',LEVEL*2+1,'.')||STR STR_LEVEL,ID,PARENT_ID,LEVEL LVL,
NVL((SELECT'N'
FROM idb_hierarchical B
WHERE I.ID=B.PARENT_ID
AND ROWNUM < 2),'Y') IS_LEAF
FROM idb_hierarchical I
START WITH PARENT_ID ISNULL
CONNECTBY PARENT_ID = PRIOR ID;

SELECT RPAD('+',LEVEL*2+1,'.')||STR STR_LEVEL,ID,PARENT_ID,LEVEL LVL,NVL((SELECT 'N'  FROM idb_hierarchical B  WHERE I.ID=B.PARENT_ID  AND ROWNUM  < 2),'Y') IS_LEAF  FROM idb_hierarchical I START WITH PARENT_ID IS NULLCONNECT BY PARENT_ID = PRIOR ID;

表3
STR_LEVEL	ID	PARENT_ID	LVL	IS_LEAF
+..A	1	1	N
+....B	2	1	2	N
+......C	3	2	3	N
+........D	4	3	4	N
+..........H	8	4	5	Y
+..........I	9	4	5	Y
+........G	7	3	4	Y
+......E	5	2	3	Y
+......F	6	2	3	Y
+..J	10	1	N
+....K	11	10	2	N
+......L	12	11	3	Y
+....M	13	10	2	Y

oracle 9i 查詢根節點

SELECT RPAD('+',LEVEL*2+1,'.')||STR STR_LEVEL,ID,PARENT_ID,LEVEL LVL
FROM idb_hierarchical I
START WITH id =2
CONNECTBY PARENT_ID = PRIOR ID;

SELECT RPAD('+',LEVEL*2+1,'.')||STR STR_LEVEL,ID,PARENT_ID,LEVEL LVL  FROM idb_hierarchical I START WITH id =2CONNECT BY PARENT_ID = PRIOR ID;

表4
STR_LEVEL	ID	PARENT_ID	LVL
+..B	2	1	1
+....C	3	2	2
+......D	4	3	3
+........H	8	4	4
+........I	9	4	4
+......G	7	3	3
+....E	5	2	2
+....F	6	2	2

根節點ID應該為3、5、6，即lvl為1即可

查詢根節點，只顯示根節點SQL

SELECT RPAD('+', LEVEL * 2 + 1, '.') || STR STR_LEVEL,
ID,
PARENT_ID,
LEVEL LVL,
(select b.str
from idb_hierarchical b
wherelevel = 1
start with b.id = 2
connectbyprior b.id = b.parent_id
) root_str
FROM idb_hierarchical I
wherelevel = 1
START WITH id = 2
CONNECTBY PARENT_ID = PRIOR ID;

SELECT RPAD('+', LEVEL * 2 + 1, '.') || STR STR_LEVEL,       ID,       PARENT_ID,       LEVEL LVL,       (select b.str          from idb_hierarchical b         where level = 1         start with b.id = 2        connect by prior b.id =  b.parent_id        ) root_str  FROM idb_hierarchical I where level = 1 START WITH id = 2CONNECT BY PARENT_ID = PRIOR ID;

表5
STR_LEVEL	ID	PARENT_ID	LVL	ROOT_STR
+..B	2	1	1	B

標明根節點SQL

SELECT RPAD('+', LEVEL * 2 + 1, '.') || STR STR_LEVEL,
ID,
PARENT_ID,
DECODE(LEVEL, 1, 'Y', 'N') is_root,
LEVEL LVL,
(select b.str
from idb_hierarchical b
wherelevel = 1
start with b.id = 2
connectbyprior b.id = b.parent_id) root_str
FROM idb_hierarchical I
START WITH id = 2
CONNECTBY PARENT_ID = PRIOR ID;

SELECT RPAD('+', LEVEL * 2 + 1, '.') || STR STR_LEVEL,       ID,       PARENT_ID,       DECODE(LEVEL, 1, 'Y', 'N') is_root,       LEVEL LVL,       (select b.str          from idb_hierarchical b         where level = 1         start with b.id = 2        connect by prior b.id = b.parent_id) root_str  FROM idb_hierarchical I START WITH id = 2CONNECT BY PARENT_ID = PRIOR ID;

表6
STR_LEVEL	ID	PARENT_ID	IS_ROOT	LVL	ROOT_STR
+..B	2	1	Y	1	B
+....C	3	2	N	2	B
+......D	4	3	N	3	B
+........H	8	4	N	4	B
+........I	9	4	N	4	B
+......G	7	3	N	3	B
+....E	5	2	N	2	B
+....F	6	2	N	2	B

在oracle 10g提供了connect_by_isleaf和connect_by_root

oracle 10g用connect_by_isleaf判斷葉節點

SELECT RPAD('+',LEVEL*2+1,'.')||STR STR_LEVEL,ID,PARENT_ID,LEVEL LVL
FROM idb_hierarchical I
where connect_by_isleaf=1
START WITH PARENT_ID ISNULL
CONNECTBY PARENT_ID = PRIOR ID;

SELECT RPAD('+',LEVEL*2+1,'.')||STR STR_LEVEL,ID,PARENT_ID,LEVEL LVL  FROM idb_hierarchical Iwhere connect_by_isleaf=1 START WITH PARENT_ID IS NULLCONNECT BY PARENT_ID = PRIOR ID;

表7
STR_LEVEL	ID	PARENT_ID	LVL
+..........H	8	4	5
+..........I	9	4	5
+........G	7	3	4
+......E	5	2	3
+......F	6	2	3
+......L	12	11	3
+....M	13	10	2

SELECT RPAD('+',LEVEL*2+1,'.')||STR STR_LEVEL,ID,PARENT_ID,LEVEL LVL,
decode(connect_by_isleaf,1,'Y','N') IS_LEAF
FROM idb_hierarchical I
START WITH PARENT_ID ISNULL
CONNECTBY PARENT_ID = PRIOR ID;

SELECT RPAD('+',LEVEL*2+1,'.')||STR STR_LEVEL,ID,PARENT_ID,LEVEL LVL,decode(connect_by_isleaf,1,'Y','N') IS_LEAF  FROM idb_hierarchical I START WITH PARENT_ID IS NULLCONNECT BY PARENT_ID = PRIOR ID;

表8
STR_LEVEL	ID	PARENT_ID	LVL	IS_LEAF
+..A	1	1	N
+....B	2	1	2	N
+......C	3	2	3	N
+........D	4	3	4	N
+..........H	8	4	5	Y
+..........I	9	4	5	Y
+........G	7	3	4	Y
+......E	5	2	3	Y
+......F	6	2	3	Y
+..J	10	1	N
+....K	11	10	2	N
+......L	12	11	3	Y
+....M	13	10	2	Y

oracle 10g用connect_by_root判斷根節點

SELECT RPAD('+', LEVEL * 2 + 1, '.') || STR STR_LEVEL,
ID,
PARENT_ID,
LEVEL LVL,
connect_by_root STR ROOT_STR
FROM idb_hierarchical I
START WITH id = 2
CONNECTBY PARENT_ID = PRIOR ID;

SELECT RPAD('+', LEVEL * 2 + 1, '.') || STR STR_LEVEL,       ID,       PARENT_ID,       LEVEL LVL,       connect_by_root STR ROOT_STR  FROM idb_hierarchical I START WITH id = 2CONNECT BY PARENT_ID = PRIOR ID;

表9
STR_LEVEL	ID	PARENT_ID	LVL	ROOT_STR
+..B	2	1	1	B
+....C	3	2	2	B
+......D	4	3	3	B
+........H	8	4	4	B
+........I	9	4	4	B
+......G	7	3	3	B
+....E	5	2	2	B
+....F	6	2	2	B

SELECT RPAD('+', LEVEL * 2 + 1, '.') || STR STR_LEVEL,
ID,
PARENT_ID,
DECODE(LEVEL, 1, 'Y', 'N') is_root,
LEVEL LVL,
connect_by_root STR ROOT_STR
FROM idb_hierarchical I
START WITH id = 3
CONNECTBY PARENT_ID = PRIOR ID;

SELECT RPAD('+', LEVEL * 2 + 1, '.') || STR STR_LEVEL,       ID,       PARENT_ID,       DECODE(LEVEL, 1, 'Y', 'N') is_root,       LEVEL LVL,       connect_by_root STR ROOT_STR  FROM idb_hierarchical I START WITH id = 3CONNECT BY PARENT_ID = PRIOR ID;

表10
STR_LEVEL	ID	PARENT_ID	IS_ROOT	LVL	ROOT_STR
+..C	3	2	Y	1	C
+....D	4	3	N	2	C
+......H	8	4	N	3	C
+......I	9	4	N	3	C
+....G	7	3	N	2	C

SELECT RPAD('+', LEVEL * 2 + 1, '.') || STR STR_LEVEL,
ID,
PARENT_ID,
DECODE(LEVEL, 1, 'Y', 'N') is_root,
LEVEL LVL,
connect_by_root STR ROOT_STR
FROM idb_hierarchical I
START WITH PARENT_ID = 2
CONNECTBY PARENT_ID = PRIOR ID;

SELECT RPAD('+', LEVEL * 2 + 1, '.') || STR STR_LEVEL,       ID,       PARENT_ID,       DECODE(LEVEL, 1, 'Y', 'N') is_root,       LEVEL LVL,       connect_by_root STR ROOT_STR  FROM idb_hierarchical I START WITH PARENT_ID = 2CONNECT BY PARENT_ID = PRIOR ID;

表11
STR_LEVEL	ID	PARENT_ID	IS_ROOT	LVL	ROOT_STR
+..C	3	2	Y	1	C
+....D	4	3	N	2	C
+......H	8	4	N	3	C
+......I	9	4	N	3	C
+....G	7	3	N	2	C
+..E	5	2	Y	1	E
+..F	6	2	Y	1	F

oracle 層次查詢判斷葉子和根節點

oracle 9i判斷是葉子或根節點，是比較麻煩的一件事情，SQL演示指令碼如下:DROPTABLE idb_hierarchical; createTABLE idb_hierarchical ( id number, parent_id number, str v

oracle 層次查詢語句

oracle connect by/start with Oracle中層次查詢語法： select ... [level | connect_by_root |connect_by_isleaf |connect_by_iscycle ] from table_nam

三十三、Oracle層次查詢 connect by prior

Oracle層次查詢 connect by prior 1、表格初始化指令碼 https://download.csdn.net/download/

oracle層次查詢connect by （讀書筆記）

--oracle層次查詢connect by --首先給scott使用者授查詢許可權：GRANT SELECT ON employees TO scott;GRANT SELECT ON jobs TO scott;CREATE TABLE employee AS SEL

Oracle下查詢儲存過程和包的語句

查詢某些包：select * From all_objects where object_type = 'PACKAGE' and object_name like '%DRB%' 查詢某些儲存過程： select * From all_objects where obj

ORACLE數據庫遞歸查詢當前節點的父節點和子節點（tree）

oracle 遞歸 ORACLE 數據庫遞歸查詢當前數據的所有孩子數據（不包含自己）SELECT id AS id, parent_id AS parentId, parent_id AS parent, name AS text FROM mdm_center STAR

根節點到葉子節點的和值(根節點逐步升位)

package leetcode; /*Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number. An example is the root-to

Mysql中的遞迴層次查詢(根據父節點查詢所有的子節點和根據子節點查詢所有的父節點)的兩種運用

1、根據子節點查詢所有的父節點建立getParentList函式 SQL語句如下: delimiter // CREATEFUNCTION `getParentList`(rootId INT) R

Java程式碼給出一個二叉樹和一個數，判斷該二叉樹是否存在一個從根節點到葉節點的和與給出的數相同

從菜鳥到大牛一定要戒驕戒躁，沉下心來慢慢打磨自己！這個題目的演算法思想分為三種情況: case1樹為空時，返回false case2 樹只有一個根節點 case3 正常情況下的樹 Java程式碼如下： /** * Definition for a binary tree

給定一個二叉樹，節點值為0-9，從根節點到葉子結點組成一個數，求二叉樹所有組成的數的和

根節點到葉子節點組成一個數前序遍歷每層的值都為上一層*10+本層結點的值 int sumNumbers(TreeNode *root) { int sum=0; if(root==NULL) re

求從根節點到葉子節點的所有路徑組成的數的和

問題：給定一顆二叉樹，節點的值只能為0~9中的一個，每一個從根節點到葉子節點的路徑代表一個數，比如，有一個從根節點到葉子節點的路徑是 1->2->3，則這個路徑代表數字是123。求出從根節點到所有葉子節點的路徑所代表數字的和是多少。再比如，有如下二叉樹：

Path Sum:判斷求根節點到葉子節點求和大小

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all

ORACLE 樹形遍歷查詢根節點、父節點、子節點

1、準備演示資料建立表結構：-- Create table createtable Z_ORG( cid NUMBER, cname VARCHAR2(32), parent_id NUMBER, create_time DATE

mysql 遞歸查詢父節點和子節點

urn while ret tree getch then 節點 cti 遞歸查父集合 --drop FUNCTION `getParentList` CREATE FUNCTION `getParentList`(rootId varchar(100)) R

Oracle子查詢和多表查詢

左外連接查詢 sele 多表查詢字段 ora 需要 avg lar 多表查詢需要用到表的連接連接可以分為：（自行百度）　　交叉連接（數字邏輯的笛卡爾積，不做解釋）　　　　等值連接　　　　　　例如：select * from t_a, t_b where t_a.

ORACLE 根據根節點查所有上層節點

style sele 社保 -c 所有 col 數據 sel 查詢 1.基本數據 SELECT * FROM TABLE_MUEN T ID CODE NAME

ORACLE分組查詢和統計等

多層分組 != pre java代碼 from pex int base lec select flow_id,rw from (select t.flow_id ,rownum as rw from apex_030200.wwv_flow_list_templates

Oracle子查詢相關內容(包含TOP-N查詢和分頁查詢)

職位 oracle子查詢員工 having 信息不同 group 最大 mount 本節介紹Oracle子查詢的相關內容：實例用到的數據為oracle中scott用戶下的emp員工表，dept部門表，數據如下：一、子查詢 1、概念：嵌入在一個查詢中的另一個

oracle 查詢鎖表和Kill

SELECT l.session_id sid, s.serial#, l.locked_mode,l.oracle_username, l.os_user_name,s.machine, s.t

oracle 子查詢和組合函式

oracle 子查詢和組合函式 --查詢與“SCOTT”在同一個部門的員工 select empno,ename,deptno from emp where deptno in (select deptno from emp where ename='SCOTT'); --查詢不在銷售部和財務部工作的僱

oracle 層次查詢判斷葉子和根節點

1.oracle9i 查詢葉節點

oracle 9i 查詢根節點

oracle 10g用connect_by_isleaf判斷葉節點

oracle 10g用connect_by_root判斷根節點

相關推薦