CBO對於Oracle SQL執行計劃的影響(之一)
1. 原始SQL語句sql
這個SQL語句是一個動態查詢語句的一部分，該查詢根據不一樣條件生成不一樣的SQL語句。
本例爲查詢2003年以來的入庫單據，不多的數據。數據庫
SELECT "SP_TRANS"."TRANS_NO",
"SP_TRANS"."TRANS_TYPE",
"SP_TRANS"."STORE_NO",
"SP_TRANS"."BILL_NO",
"SP_TRANS"."TRANSDATE",
"SP_TRANS"."MANAGER_ID",
"SP_TRANS"."REMARK",
"SP_TRANS"."STATE",
"SP_TRANS_SUB"."TRANS_NO",
"SP_TRANS_SUB"."ITEM_CODE",
"SP_TRANS_SUB"."COUNTRY",
"SP_TRANS_SUB"."QTY",
"SP_TRANS_SUB"."PRICE",
"SP_TRANS_SUB"."TOTAL",
"SP_CHK"."CHK_NO",
"SP_CHK"."RECEIVE_NO",
"SP_CHK"."CHECKER",
"SP_CHK_SUB"."CHK_NO",
"SP_CHK_SUB"."ITEM_CODE",
"SP_CHK_SUB"."COUNTRY",
"SP_CHK_SUB"."PLAN_NO",
"SP_CHK_SUB"."PLAN_LINE",
"SP_CHK_SUB"."QTY_CHECKOUT",
"SP_CHK_SUB"."NOW_QTY",
"SP_RECEIVE"."RECEIVE_NO",
"SP_RECEIVE"."VENDOR_NAME",
"SP_RECEIVE"."BUYER",
"SP_RECEIVE_SUB"."RECEIVE_NO",
"SP_RECEIVE_SUB"."PLAN_NO",
"SP_RECEIVE_SUB"."PLAN_LINE",
"SP_RECEIVE_SUB"."ITEM_NAME",
"SP_RECEIVE_SUB"."COUNTRY",
"SP_ITEM"."ITEM_CODE",
"SP_ITEM"."CHART_ID",
"SP_ITEM"."SPECIFICATION"
FROM "SP_TRANS",
"SP_TRANS_SUB",
"SP_CHK",
"SP_CHK_SUB",
"SP_RECEIVE",
"SP_RECEIVE_SUB",
"SP_ITEM"
WHERE ( "SP_TRANS_SUB"."TRANS_NO" = "SP_TRANS"."TRANS_NO" ) and
("SP_TRANS"."BILL_NO" = "SP_CHK"."CHK_NO") and
( "SP_CHK_SUB"."CHK_NO" = "SP_CHK"."CHK_NO" ) and
( "SP_CHK"."RECEIVE_NO" = "SP_RECEIVE"."RECEIVE_NO" ) and
( "SP_CHK"."STATE" = 15 ) and
( "SP_RECEIVE_SUB"."RECEIVE_NO" = "SP_RECEIVE"."RECEIVE_NO" ) and
( "SP_TRANS_SUB"."ITEM_CODE" = "SP_ITEM"."ITEM_CODE" ) and
( "SP_TRANS_SUB"."ITEM_CODE" = "SP_CHK_SUB"."ITEM_CODE" ) and
( "SP_CHK_SUB"."ITEM_CODE" = "SP_RECEIVE_SUB"."ITEM_CODE" ) and
( "SP_CHK_SUB"."COUNTRY" = "SP_TRANS_SUB"."COUNTRY" ) and
( "SP_CHK_SUB"."COUNTRY" = "SP_RECEIVE_SUB"."COUNTRY" ) and
( "SP_CHK_SUB"."PLAN_NO" = "SP_RECEIVE_SUB"."PLAN_NO" ) and
( "SP_CHK_SUB"."PLAN_LINE" = "SP_RECEIVE_SUB"."PLAN_LINE" ) and
(to_char("SP_TRANS"."TRANSDATE" ,'YYYY-MM-DD') >='2003-01-01')
/
2. 執行計劃
咱們的數據庫使用dbms_stats.gather_schema_stats分析過，具備足夠及時的全部數據，然而在CBO的執行計劃下，優化器選擇了徹底
不一樣的執行計劃.
a. no hints
這是未加任何提示時，Oralce選擇的執行路徑，在實際程序中，用戶說死掉了，經過執行計劃咱們知道，不是死掉了，是慢！！！優化
Execution Plan ---------------------------------------------------------- 0 SELECT STATEMENT Optimizer=CHOOSE (Cost=2057 Card=1 Bytes=288) 1 0 NESTED LOOPS (Cost=2057 Card=1 Bytes=288) 2 1 NESTED LOOPS (Cost=2056 Card=1 Bytes=256) 3 2 NESTED LOOPS (Cost=2054 Card=1 Bytes=219) 4 3 NESTED LOOPS (Cost=2053 Card=1 Bytes=178) 5 4 NESTED LOOPS (Cost=2009 Card=1 Bytes=131) 6 5 MERGE JOIN (Cost=2008 Card=1 Bytes=100) 7 6 SORT (JOIN) (Cost=950 Card=36412 Bytes=1747776) 8 7 TABLE ACCESS (FULL) OF 'SP_CHK_SUB' (Cost=59 Card=36412 Bytes=1747776) 9 6 SORT (JOIN) (Cost=1058 Card=36730 Bytes=1909960) 10 9 TABLE ACCESS (FULL) OF 'SP_RECEIVE_SUB' (Cost=89 Card=36730 Bytes=1909960) 11 5 TABLE ACCESS (BY INDEX ROWID) OF 'SP_CHK' (Cost=1 Card=3870 Bytes=119970) 12 11 INDEX (UNIQUE SCAN) OF 'PK_SP_CHK' (UNIQUE) 13 4 TABLE ACCESS (FULL) OF 'SP_TRANS' (Cost=44 Card=1717 Bytes=80699) 14 3 TABLE ACCESS (BY INDEX ROWID) OF 'SP_RECEIVE' (Cost=1 Card=7816 Bytes=320456) 15 14 INDEX (UNIQUE SCAN) OF 'PK_SP_RECEIVE' (UNIQUE) 16 2 TABLE ACCESS (BY INDEX ROWID) OF 'SP_TRANS_SUB' (Cost=2 Card=136371 Bytes=5045727) 17 16 INDEX (UNIQUE SCAN) OF 'PK_SP_TRANS_SUB' (UNIQUE) (Cost=1 Card=136371) 18 1 TABLE ACCESS (BY INDEX ROWID) OF 'SP_ITEM' (Cost=1 Card=29763 Bytes=952416) 19 18 INDEX (UNIQUE SCAN) OF 'SYS_C0012193' (UNIQUE)
用足夠的耐心，咱們獲得了該計劃的執行結果。code
SQL> SELECT "SP_TRANS"."TRANS_NO",
2 "SP_TRANS"."TRANS_TYPE",
3 "SP_TRANS"."STORE_NO",
4 "SP_TRANS"."BILL_NO",
5 "SP_TRANS"."TRANSDATE",
6 "SP_TRANS"."MANAGER_ID",
7 "SP_TRANS"."REMARK",
8 "SP_TRANS"."STATE",
9 "SP_TRANS_SUB"."TRANS_NO",
10 "SP_TRANS_SUB"."ITEM_CODE",
11 "SP_TRANS_SUB"."COUNTRY",
12 "SP_TRANS_SUB"."QTY",
13 "SP_TRANS_SUB"."PRICE",
14 "SP_TRANS_SUB"."TOTAL",
15 "SP_CHK"."CHK_NO",
16 "SP_CHK"."RECEIVE_NO",
17 "SP_CHK"."CHECKER",
18 "SP_CHK_SUB"."CHK_NO",
19 "SP_CHK_SUB"."ITEM_CODE",
20 "SP_CHK_SUB"."COUNTRY",
21 "SP_CHK_SUB"."PLAN_NO",
22 "SP_CHK_SUB"."PLAN_LINE",
23 "SP_CHK_SUB"."QTY_CHECKOUT",
24 "SP_CHK_SUB"."NOW_QTY",
25 "SP_RECEIVE"."RECEIVE_NO",
26 "SP_RECEIVE"."VENDOR_NAME",
27 "SP_RECEIVE"."BUYER",
28 "SP_RECEIVE_SUB"."RECEIVE_NO",
29 "SP_RECEIVE_SUB"."PLAN_NO",
30 "SP_RECEIVE_SUB"."PLAN_LINE",
31 "SP_RECEIVE_SUB"."ITEM_NAME",
32 "SP_RECEIVE_SUB"."COUNTRY",
33 "SP_ITEM"."ITEM_CODE",
34 "SP_ITEM"."CHART_ID",
35 "SP_ITEM"."SPECIFICATION"
36 FROM "SP_TRANS",
37 "SP_TRANS_SUB",
38 "SP_CHK",
39 "SP_CHK_SUB",
40 "SP_RECEIVE",
41 "SP_RECEIVE_SUB",
42 "SP_ITEM"
43 WHERE ( "SP_TRANS_SUB"."TRANS_NO" = "SP_TRANS"."TRANS_NO" ) and
44 ( "SP_TRANS"."BILL_NO" = "SP_CHK"."CHK_NO") and
45 ( "SP_CHK_SUB"."CHK_NO" = "SP_CHK"."CHK_NO" ) and
46 ( "SP_CHK"."RECEIVE_NO" = "SP_RECEIVE"."RECEIVE_NO" ) and
47 ( "SP_CHK"."STATE" = 15 ) and
48 ( "SP_RECEIVE_SUB"."RECEIVE_NO" = "SP_RECEIVE"."RECEIVE_NO" ) and
49 ( "SP_TRANS_SUB"."ITEM_CODE" = "SP_ITEM"."ITEM_CODE" ) and
50 ( "SP_TRANS_SUB"."ITEM_CODE" = "SP_CHK_SUB"."ITEM_CODE" ) and
51 ( "SP_CHK_SUB"."ITEM_CODE" = "SP_RECEIVE_SUB"."ITEM_CODE" ) and
52 ( "SP_CHK_SUB"."COUNTRY" = "SP_TRANS_SUB"."COUNTRY" ) and
53 ( "SP_CHK_SUB"."COUNTRY" = "SP_RECEIVE_SUB"."COUNTRY" ) and
54 ( "SP_CHK_SUB"."PLAN_NO" = "SP_RECEIVE_SUB"."PLAN_NO" ) and
55 ( "SP_CHK_SUB"."PLAN_LINE" = "SP_RECEIVE_SUB"."PLAN_LINE" ) and
56 (to_char("SP_TRANS"."TRANSDATE" ,'YYYY-MM-DD') >='2003-01-01')
57 /
130 rows selected.
Elapsed: 00: 29: 1785.47
Execution Plan
----------------------------------------------------------
0 SELECT STATEMENT Optimizer=CHOOSE (Cost=2057 Card=1 Bytes=288)
1 0 NESTED LOOPS (Cost=2057 Card=1 Bytes=288)
2 1 NESTED LOOPS (Cost=2056 Card=1 Bytes=256)
3 2 NESTED LOOPS (Cost=2054 Card=1 Bytes=219)
4 3 NESTED LOOPS (Cost=2053 Card=1 Bytes=178)
5 4 NESTED LOOPS (Cost=2009 Card=1 Bytes=131)
6 5 MERGE JOIN (Cost=2008 Card=1 Bytes=100)
7 6 SORT (JOIN) (Cost=950 Card=36412 Bytes=1747776)
8 7 TABLE ACCESS (FULL) OF 'SP_CHK_SUB' (Cost=59 Card=36412 Bytes=1747776)
9 6 SORT (JOIN) (Cost=1058 Card=36730 Bytes=1909960)
10 9 TABLE ACCESS (FULL) OF 'SP_RECEIVE_SUB' (Cost=89 Card=36730 Bytes=1909960)
11 5 TABLE ACCESS (BY INDEX ROWID) OF 'SP_CHK' (Cost=1 Card=3870 Bytes=119970)
12 11 INDEX (UNIQUE SCAN) OF 'PK_SP_CHK' (UNIQUE)
13 4 TABLE ACCESS (FULL) OF 'SP_TRANS' (Cost=44 Card=1717 Bytes=80699)
14 3 TABLE ACCESS (BY INDEX ROWID) OF 'SP_RECEIVE' (Cost=1 Card=7816 Bytes=320456)
15 14 INDEX (UNIQUE SCAN) OF 'PK_SP_RECEIVE' (UNIQUE)
16 2 TABLE ACCESS (BY INDEX ROWID) OF 'SP_TRANS_SUB' (Cost=2 Card=136371 Bytes=5045727)
17 16 INDEX (UNIQUE SCAN) OF 'PK_SP_TRANS_SUB' (UNIQUE) (Cost=1 Card=136371)
18 1 TABLE ACCESS (BY INDEX ROWID) OF 'SP_ITEM' (Cost=1 Card=29763 Bytes=952416)
19 18 INDEX (UNIQUE SCAN) OF 'SYS_C0012193' (UNIQUE)
Statistics
----------------------------------------------------------
16 recursive calls
186307 db block gets
10685361 consistent gets
2329 physical reads
0 redo size
38486 bytes sent via SQL*Net to client
1117 bytes received via SQL*Net from client
10 SQL*Net roundtrips to/from client
7 sorts (memory)
2 sorts (disk)
130 rows processed
能夠看到，該執行計劃消耗了大量的資源以及時間，這種狀況是沒法忍受的。ip
b. rule
在RBO條件下，該語句是執行很快的
加入rule提示，咱們獲得如下執行計劃：資源
Execution Plan ---------------------------------------------------------- 0 SELECT STATEMENT Optimizer=HINT: RULE 1 0 NESTED LOOPS 2 1 NESTED LOOPS 3 2 NESTED LOOPS 4 3 NESTED LOOPS 5 4 NESTED LOOPS 6 5 NESTED LOOPS 7 6 TABLE ACCESS (FULL) OF 'SP_TRANS_SUB' 8 6 TABLE ACCESS (BY INDEX ROWID) OF 'SP_ITEM' 9 8 INDEX (UNIQUE SCAN) OF 'SYS_C0012193' (UNIQUE) 10 5 TABLE ACCESS (BY INDEX ROWID) OF 'SP_TRANS' 11 10 INDEX (UNIQUE SCAN) OF 'PK_HSP_TRANS' (UNIQUE) 12 4 TABLE ACCESS (BY INDEX ROWID) OF 'SP_CHK' 13 12 INDEX (UNIQUE SCAN) OF 'PK_SP_CHK' (UNIQUE) 14 3 TABLE ACCESS (BY INDEX ROWID) OF 'SP_RECEIVE' 15 14 INDEX (UNIQUE SCAN) OF 'PK_SP_RECEIVE' (UNIQUE) 16 2 TABLE ACCESS (BY INDEX ROWID) OF 'SP_CHK_SUB' 17 16 INDEX (RANGE SCAN) OF 'IDX_CHK_SUB_ITEM_CODE' (NON-UNIQUE) 18 1 TABLE ACCESS (BY INDEX ROWID) OF 'SP_RECEIVE_SUB' 19 18 INDEX (UNIQUE SCAN) OF 'PK_SP_RECEIVE_SUB' (UNIQUE)
執行該計劃，咱們獲得如下輸出：get
SQL>@sql
130 rows selected.
Elapsed: 00: 00: 12.17
Execution Plan
----------------------------------------------------------
0 SELECT STATEMENT Optimizer=HINT: RULE
1 0 NESTED LOOPS
2 1 NESTED LOOPS
3 2 NESTED LOOPS
4 3 NESTED LOOPS
5 4 NESTED LOOPS
6 5 NESTED LOOPS
7 6 TABLE ACCESS (FULL) OF 'SP_TRANS_SUB'
8 6 TABLE ACCESS (BY INDEX ROWID) OF 'SP_ITEM'
9 8 INDEX (UNIQUE SCAN) OF 'SYS_C0012193' (UNIQUE)
10 5 TABLE ACCESS (BY INDEX ROWID) OF 'SP_TRANS'
11 10 INDEX (UNIQUE SCAN) OF 'PK_HSP_TRANS' (UNIQUE)
12 4 TABLE ACCESS (BY INDEX ROWID) OF 'SP_CHK'
13 12 INDEX (UNIQUE SCAN) OF 'PK_SP_CHK' (UNIQUE)
14 3 TABLE ACCESS (BY INDEX ROWID) OF 'SP_RECEIVE'
15 14 INDEX (UNIQUE SCAN) OF 'PK_SP_RECEIVE' (UNIQUE)
16 2 TABLE ACCESS (BY INDEX ROWID) OF 'SP_CHK_SUB'
17 16 INDEX (RANGE SCAN) OF 'IDX_CHK_SUB_ITEM_CODE' (NON-UNIQUE)
18 1 TABLE ACCESS (BY INDEX ROWID) OF 'SP_RECEIVE_SUB'
19 18 INDEX (UNIQUE SCAN) OF 'PK_SP_RECEIVE_SUB' (UNIQUE)
Statistics
----------------------------------------------------------
0 recursive calls
6 db block gets
829182 consistent gets
0 physical reads
0 redo size
37383 bytes sent via SQL*Net to client
1127 bytes received via SQL*Net from client
10 SQL*Net roundtrips to/from client
0 sorts (memory)
0 sorts (disk)
130 rows processed
SQL>
c. ordered
而後我想起了Ordered提示
使用該提示的執行計劃以下：io
SQL>@sql
已選擇130行。
已用時間: 00: 00: 05.67
Execution Plan
----------------------------------------------------------
0 SELECT STATEMENT Optimizer=CHOOSE (Cost=3284 Card=1 Bytes=288)
1 0 NESTED LOOPS (Cost=3284 Card=1 Bytes=288)
2 1 NESTED LOOPS (Cost=3283 Card=1 Bytes=256)
3 2 MERGE JOIN (Cost=3282 Card=1 Bytes=204)
4 3 SORT (JOIN) (Cost=2333 Card=6823 Bytes=1064388)
5 4 HASH JOIN (Cost=1848 Card=6823 Bytes=1064388)
6 5 HASH JOIN (Cost=216 Card=1717 Bytes=204323)
7 6 HASH JOIN (Cost=96 Card=1717 Bytes=133926)
8 7 TABLE ACCESS (FULL) OF 'SP_TRANS' (Cost=44 Card=1717 Bytes=80699)
9 7 TABLE ACCESS (FULL) OF 'SP_CHK' (Cost=13 Card=3870 Bytes=119970)
10 6 TABLE ACCESS (FULL) OF 'SP_RECEIVE' (Cost=17 Card=7816 Bytes=320456)
11 5 TABLE ACCESS (FULL) OF 'SP_TRANS_SUB' (Cost=155 Card=136371 Bytes=5045727)
12 3 SORT (JOIN) (Cost=950 Card=36412 Bytes=1747776)
13 12 TABLE ACCESS (FULL) OF 'SP_CHK_SUB' (Cost=59 Card=36412 Bytes=1747776)
14 2 TABLE ACCESS (BY INDEX ROWID) OF 'SP_RECEIVE_SUB' (Cost=1 Card=36730 Bytes=1909960)
15 14 INDEX (UNIQUE SCAN) OF 'PK_SP_RECEIVE_SUB' (UNIQUE)
16 1 TABLE ACCESS (BY INDEX ROWID) OF 'SP_ITEM' (Cost=1 Card=29763 Bytes=952416)
17 16 INDEX (UNIQUE SCAN) OF 'SYS_C0012193' (UNIQUE)
Statistics
----------------------------------------------------------
8 recursive calls
88 db block gets
2667 consistent gets
1093 physical reads
0 redo size
37285 bytes sent via SQL*Net to client
1109 bytes received via SQL*Net from client
10 SQL*Net roundtrips to/from client
8 sorts (memory)
1 sorts (disk)
130 rows processed
SQL>
很幸運，Ordered提示使Oracle選擇了較好的執行計劃。cli
因此會產生這樣的效果，是由於在CBO的執行計劃中，對於7張數據表，Oracle須要計算7！(5040)個鏈接順序，而後比較各個順序的
成本，最後選擇成本較低的執行計劃。
顯然，在這一判斷上耗費了大量的時間。當咱們使用ordered hints的時候，Oracle就不須要這一計算步驟，它只須要使用咱們指定的
順序，而後快速的給出結果。而後問題迎刃而解。sed
相關文章
- 1. CBO對於Oracle SQL執行計劃的影響(之二)
- 2. SQL執行計劃之sql_trace
- 3. 執行計劃--WHERE條件的先後順序對執行計劃的影響
- 4. Oracle之一條SQL對應多個執行計劃
- 5. Hive——SQL的執行計劃（8）
- 6. Oracle sql優化（三）SQL執行計劃
- 7. Oracle固定SQL的執行計劃(一)---SQL Profile
- 8. 執行計劃
- 9. SQL之執行計劃
- 10. oracle 固定執行計劃(一）之 sql_profile
- 更多相關文章...
- • MyBatis SqlSession和Mapper接口執行Sql - MyBatis教程
- • 一對一關聯查詢 - MyBatis教程
- • ☆基於Java Instrument的Agent實現
- • 互聯網組織的未來：剖析GitHub員工的任性之源
相關標籤/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
最新文章
- 1. 外部其他進程嵌入到qt FindWindow獲得窗口句柄 報錯無法鏈接的外部符號 [email protected] 無法被([email protected]@[email protected]@@引用
- 2. UVa 11524 - InCircle
- 3. The Monocycle（bfs）
- 4. VEC-C滑窗
- 5. 堆排序的應用-TOPK問題
- 6. 實例演示ElasticSearch索引查詢term,match,match_phase,query_string之間的區別
- 7. 數學基礎知識 集合
- 8. amazeUI 復擇框問題解決
- 9. 揹包問題理解
- 10. 算數平均-幾何平均不等式的證明,從麥克勞林到柯西
歡迎關注本站公眾號,獲取更多信息
