[20160212]閉包傳遞4.txt
[20160212]閉包傳遞4.txt
--所謂閉包傳遞是指sql語句的謂詞條件A=B and B=C 可以推出 A=C. oracle 的 最佳化器能夠利用這個特性最佳化sql語句。
--前一陣子看電子電子書<Apress.Expert.Oracle.SQL.Optimization.Deployment.and.Statistics.1430259779.pdf>測試連結:
http://blog.itpub.net/267265/viewspace-1981803/
http://blog.itpub.net/267265/viewspace-1987668/
--晚上以前學習oracle最佳化時,我練習過透過hint控制4個表的連線順序問題.自己重複測試看看,難道4個表就沒有問題嗎?
1.環境:
SCOTT@test01p> @ ver1
PORT_STRING VERSION BANNER CON_ID
-------------------- ----------- ---------------------------------------------------------------------------- ------
IBMPC/WIN_NT64-9.1.0 12.1.0.1.0 Oracle Database 12c Enterprise Edition Release 12.1.0.1.0 - 64bit Production 0
create table t1 as select rownum id,rownum||'t1' name from dual connect by level<=5;
create table t2 as select rownum+1 id,rownum||'t2' name from dual connect by level<=5;
create table t3 as select rownum+2 id,rownum||'t3' name from dual connect by level<=5;
create table t4 as select rownum+3 id,rownum||'t3' name from dual connect by level<=5;
-- 分析表.Method_Opt => 'FOR ALL COLUMNS SIZE 1 '
2.如果要實現(t1,t2)->t4->t3 這樣的連線順序,如果要這樣寫:
select /*+ leading (t1 t2 t4 t3) */ * from t1,t2,t3,t4 where t1.id=t2.id and t2.id=t3.id and t3.id=t4.id;
Plan hash value: 3021121231
------------------------------------------------------------------------------------------------------------------------------------------------------------
| Id | Operation | Name | Starts | E-Rows |E-Bytes| Cost (%CPU)| E-Time | A-Rows | A-Time | Buffers | Reads | OMem | 1Mem | Used-Mem |
------------------------------------------------------------------------------------------------------------------------------------------------------------
| 0 | SELECT STATEMENT | | 1 | | | 16 (100)| | 2 |00:00:00.25 | 13 | 20 | | | |
|* 1 | HASH JOIN | | 1 | 5 | 140 | 16 (0)| 00:00:01 | 2 |00:00:00.25 | 13 | 20 | 1245K| 1245K| 1158K (0)|
| 2 | MERGE JOIN CARTESIAN| | 1 | 25 | 525 | 13 (0)| 00:00:01 | 20 |00:00:00.19 | 9 | 14 | | | |
|* 3 | HASH JOIN | | 1 | 5 | 70 | 6 (0)| 00:00:01 | 4 |00:00:00.13 | 6 | 8 | 1888K| 1888K| 1091K (0)|
| 4 | TABLE ACCESS FULL | T1 | 1 | 5 | 35 | 3 (0)| 00:00:01 | 5 |00:00:00.04 | 3 | 2 | | | |
| 5 | TABLE ACCESS FULL | T2 | 1 | 5 | 35 | 3 (0)| 00:00:01 | 5 |00:00:00.04 | 3 | 6 | | | |
| 6 | BUFFER SORT | | 4 | 5 | 35 | 10 (0)| 00:00:01 | 20 |00:00:00.05 | 3 | 6 | 2048 | 2048 | 2048 (0)|
| 7 | TABLE ACCESS FULL | T4 | 1 | 5 | 35 | 1 (0)| 00:00:01 | 5 |00:00:00.05 | 3 | 6 | | | |
| 8 | TABLE ACCESS FULL | T3 | 1 | 5 | 35 | 3 (0)| 00:00:01 | 5 |00:00:00.06 | 4 | 6 | | | |
------------------------------------------------------------------------------------------------------------------------------------------------------------
Query Block Name / Object Alias (identified by operation id):
-------------------------------------------------------------
1 - SEL$1
4 - SEL$1 / T1@SEL$1
5 - SEL$1 / T2@SEL$1
7 - SEL$1 / T4@SEL$1
8 - SEL$1 / T3@SEL$1
Predicate Information (identified by operation id):
---------------------------------------------------
1 - access("T2"."ID"="T3"."ID" AND "T3"."ID"="T4"."ID")
3 - access("T1"."ID"="T2"."ID")
--因為t1,t2 與T4之間沒有顯式的定義相等.所以要很好的控制執行計劃,必須顯式定義:
select /*+ leading (t1 t2 t4 t3) */ * from t1,t2,t3,t4 where t1.id=t2.id and t2.id=t4.id and t3.id=t4.id;
~~~~~~~~~~~
--注意下劃線部分修改的條件:
Plan hash value: 424258640
--------------------------------------------------------------------------------------------------------------------------------------------------
| Id | Operation | Name | Starts | E-Rows |E-Bytes| Cost (%CPU)| E-Time | A-Rows | A-Time | Buffers | OMem | 1Mem | Used-Mem |
--------------------------------------------------------------------------------------------------------------------------------------------------
| 0 | SELECT STATEMENT | | 1 | | | 12 (100)| | 2 |00:00:00.04 | 13 | | | |
|* 1 | HASH JOIN | | 1 | 5 | 140 | 12 (0)| 00:00:01 | 2 |00:00:00.04 | 13 | 1245K| 1245K| 404K (0)|
|* 2 | HASH JOIN | | 1 | 5 | 105 | 9 (0)| 00:00:01 | 2 |00:00:00.04 | 9 | 1451K| 1451K| 973K (0)|
|* 3 | HASH JOIN | | 1 | 5 | 70 | 6 (0)| 00:00:01 | 4 |00:00:00.04 | 6 | 1888K| 1888K| 1094K (0)|
| 4 | TABLE ACCESS FULL| T1 | 1 | 5 | 35 | 3 (0)| 00:00:01 | 5 |00:00:00.01 | 3 | | | |
| 5 | TABLE ACCESS FULL| T2 | 1 | 5 | 35 | 3 (0)| 00:00:01 | 5 |00:00:00.01 | 3 | | | |
| 6 | TABLE ACCESS FULL | T4 | 1 | 5 | 35 | 3 (0)| 00:00:01 | 5 |00:00:00.01 | 3 | | | |
| 7 | TABLE ACCESS FULL | T3 | 1 | 5 | 35 | 3 (0)| 00:00:01 | 5 |00:00:00.01 | 4 | | | |
--------------------------------------------------------------------------------------------------------------------------------------------------
Query Block Name / Object Alias (identified by operation id):
-------------------------------------------------------------
1 - SEL$1
4 - SEL$1 / T1@SEL$1
5 - SEL$1 / T2@SEL$1
6 - SEL$1 / T4@SEL$1
7 - SEL$1 / T3@SEL$1
Predicate Information (identified by operation id):
---------------------------------------------------
1 - access("T3"."ID"="T4"."ID")
2 - access("T2"."ID"="T4"."ID")
3 - access("T1"."ID"="T2"."ID")
--這樣就不會出現CARTESIAN.
--所謂閉包傳遞是指sql語句的謂詞條件A=B and B=C 可以推出 A=C. oracle 的 最佳化器能夠利用這個特性最佳化sql語句。
--前一陣子看電子電子書<Apress.Expert.Oracle.SQL.Optimization.Deployment.and.Statistics.1430259779.pdf>測試連結:
http://blog.itpub.net/267265/viewspace-1981803/
http://blog.itpub.net/267265/viewspace-1987668/
--晚上以前學習oracle最佳化時,我練習過透過hint控制4個表的連線順序問題.自己重複測試看看,難道4個表就沒有問題嗎?
1.環境:
SCOTT@test01p> @ ver1
PORT_STRING VERSION BANNER CON_ID
-------------------- ----------- ---------------------------------------------------------------------------- ------
IBMPC/WIN_NT64-9.1.0 12.1.0.1.0 Oracle Database 12c Enterprise Edition Release 12.1.0.1.0 - 64bit Production 0
create table t1 as select rownum id,rownum||'t1' name from dual connect by level<=5;
create table t2 as select rownum+1 id,rownum||'t2' name from dual connect by level<=5;
create table t3 as select rownum+2 id,rownum||'t3' name from dual connect by level<=5;
create table t4 as select rownum+3 id,rownum||'t3' name from dual connect by level<=5;
-- 分析表.Method_Opt => 'FOR ALL COLUMNS SIZE 1 '
2.如果要實現(t1,t2)->t4->t3 這樣的連線順序,如果要這樣寫:
select /*+ leading (t1 t2 t4 t3) */ * from t1,t2,t3,t4 where t1.id=t2.id and t2.id=t3.id and t3.id=t4.id;
Plan hash value: 3021121231
------------------------------------------------------------------------------------------------------------------------------------------------------------
| Id | Operation | Name | Starts | E-Rows |E-Bytes| Cost (%CPU)| E-Time | A-Rows | A-Time | Buffers | Reads | OMem | 1Mem | Used-Mem |
------------------------------------------------------------------------------------------------------------------------------------------------------------
| 0 | SELECT STATEMENT | | 1 | | | 16 (100)| | 2 |00:00:00.25 | 13 | 20 | | | |
|* 1 | HASH JOIN | | 1 | 5 | 140 | 16 (0)| 00:00:01 | 2 |00:00:00.25 | 13 | 20 | 1245K| 1245K| 1158K (0)|
| 2 | MERGE JOIN CARTESIAN| | 1 | 25 | 525 | 13 (0)| 00:00:01 | 20 |00:00:00.19 | 9 | 14 | | | |
|* 3 | HASH JOIN | | 1 | 5 | 70 | 6 (0)| 00:00:01 | 4 |00:00:00.13 | 6 | 8 | 1888K| 1888K| 1091K (0)|
| 4 | TABLE ACCESS FULL | T1 | 1 | 5 | 35 | 3 (0)| 00:00:01 | 5 |00:00:00.04 | 3 | 2 | | | |
| 5 | TABLE ACCESS FULL | T2 | 1 | 5 | 35 | 3 (0)| 00:00:01 | 5 |00:00:00.04 | 3 | 6 | | | |
| 6 | BUFFER SORT | | 4 | 5 | 35 | 10 (0)| 00:00:01 | 20 |00:00:00.05 | 3 | 6 | 2048 | 2048 | 2048 (0)|
| 7 | TABLE ACCESS FULL | T4 | 1 | 5 | 35 | 1 (0)| 00:00:01 | 5 |00:00:00.05 | 3 | 6 | | | |
| 8 | TABLE ACCESS FULL | T3 | 1 | 5 | 35 | 3 (0)| 00:00:01 | 5 |00:00:00.06 | 4 | 6 | | | |
------------------------------------------------------------------------------------------------------------------------------------------------------------
Query Block Name / Object Alias (identified by operation id):
-------------------------------------------------------------
1 - SEL$1
4 - SEL$1 / T1@SEL$1
5 - SEL$1 / T2@SEL$1
7 - SEL$1 / T4@SEL$1
8 - SEL$1 / T3@SEL$1
Predicate Information (identified by operation id):
---------------------------------------------------
1 - access("T2"."ID"="T3"."ID" AND "T3"."ID"="T4"."ID")
3 - access("T1"."ID"="T2"."ID")
--因為t1,t2 與T4之間沒有顯式的定義相等.所以要很好的控制執行計劃,必須顯式定義:
select /*+ leading (t1 t2 t4 t3) */ * from t1,t2,t3,t4 where t1.id=t2.id and t2.id=t4.id and t3.id=t4.id;
~~~~~~~~~~~
--注意下劃線部分修改的條件:
Plan hash value: 424258640
--------------------------------------------------------------------------------------------------------------------------------------------------
| Id | Operation | Name | Starts | E-Rows |E-Bytes| Cost (%CPU)| E-Time | A-Rows | A-Time | Buffers | OMem | 1Mem | Used-Mem |
--------------------------------------------------------------------------------------------------------------------------------------------------
| 0 | SELECT STATEMENT | | 1 | | | 12 (100)| | 2 |00:00:00.04 | 13 | | | |
|* 1 | HASH JOIN | | 1 | 5 | 140 | 12 (0)| 00:00:01 | 2 |00:00:00.04 | 13 | 1245K| 1245K| 404K (0)|
|* 2 | HASH JOIN | | 1 | 5 | 105 | 9 (0)| 00:00:01 | 2 |00:00:00.04 | 9 | 1451K| 1451K| 973K (0)|
|* 3 | HASH JOIN | | 1 | 5 | 70 | 6 (0)| 00:00:01 | 4 |00:00:00.04 | 6 | 1888K| 1888K| 1094K (0)|
| 4 | TABLE ACCESS FULL| T1 | 1 | 5 | 35 | 3 (0)| 00:00:01 | 5 |00:00:00.01 | 3 | | | |
| 5 | TABLE ACCESS FULL| T2 | 1 | 5 | 35 | 3 (0)| 00:00:01 | 5 |00:00:00.01 | 3 | | | |
| 6 | TABLE ACCESS FULL | T4 | 1 | 5 | 35 | 3 (0)| 00:00:01 | 5 |00:00:00.01 | 3 | | | |
| 7 | TABLE ACCESS FULL | T3 | 1 | 5 | 35 | 3 (0)| 00:00:01 | 5 |00:00:00.01 | 4 | | | |
--------------------------------------------------------------------------------------------------------------------------------------------------
Query Block Name / Object Alias (identified by operation id):
-------------------------------------------------------------
1 - SEL$1
4 - SEL$1 / T1@SEL$1
5 - SEL$1 / T2@SEL$1
6 - SEL$1 / T4@SEL$1
7 - SEL$1 / T3@SEL$1
Predicate Information (identified by operation id):
---------------------------------------------------
1 - access("T3"."ID"="T4"."ID")
2 - access("T2"."ID"="T4"."ID")
3 - access("T1"."ID"="T2"."ID")
--這樣就不會出現CARTESIAN.
來自 “ ITPUB部落格 ” ,連結:http://blog.itpub.net/267265/viewspace-1988061/,如需轉載,請註明出處,否則將追究法律責任。
相關文章
- 利用閉包傳遞引數
- POJ 3360-Cow Contest(傳遞閉包)
- [20160213]閉包傳遞5.txt
- [20160211]閉包傳遞3.txt
- [20160210]閉包傳遞2.txt
- POJ3660 Cow Contest【Floyd演算法 傳遞閉包】演算法
- [20160125]閉包傳遞問題.txt
- swift 閉包傳值Swift
- poj2594Treasure Exploration【最小路徑覆蓋+floyd傳遞閉包】
- JS函式表示式——函式遞迴、閉包JS函式遞迴
- 值傳遞與引用傳遞
- 值傳遞和引用傳遞
- 閉包
- BZOJ 1612 [Usaco2008 Jan]Cow Contest奶牛的比賽:floyd傳遞閉包
- 用閉包替換遞迴實現斐波拉契數列遞迴
- 閉包 | 淺談JavaScript閉包問題JavaScript
- Swift-逃逸閉包、自動閉包Swift
- Windows 10傳遞最佳化功能有什麼用 Windows 10傳遞最佳化功能怎麼關閉Windows
- JavaScript的值傳遞和引用傳遞JavaScript
- 快速搞懂值傳遞與引用傳遞
- Java的值傳遞和引用傳遞Java
- Python3之從遞迴到閉包再到裝飾器Python遞迴
- 【集合論】關係閉包 ( 關係閉包求法 | 關係圖求閉包 | 關係矩陣求閉包 | 閉包運算與關係性質 | 閉包複合運算 )矩陣
- PHP 閉包PHP
- JavaScript閉包JavaScript
- Golang閉包Golang
- golang 閉包Golang
- JavaScript 閉包JavaScript
- 理解“閉包”
- Swift 閉包Swift
- Swift,閉包Swift
- 理解閉包
- Swift - 閉包Swift
- lisp 閉包Lisp
- JavaScript - 閉包JavaScript
- go 值傳遞和地址傳遞的例子Go
- Java - 是值傳遞還是引用傳遞Java
- Java中的值傳遞和引用傳遞Java