Oracle 利用执行计划来避免排序操作

在oracle中，利用index来避免排序

SQL> CREATE TABLE T_NOSORT (ID NUMBER PRIMARY KEY, NAME VARCHAR2(30) NOT NULL);

SQL> CREATE INDEX IND_T_NOSORT_NAME ON T_NOSORT(NAME);

SQL> INSERT INTO T_NOSORT SELECT ROWNUM, TABLE_NAME FROM USER_TABLES;

SQL> COMMIT;

SQL> SET AUTOT ON EXP

SQL> SELECT ID, NAME FROM T_NOSORT ORDER BY NAME;

----------------------------------------------------------

Plan hash value: 1041838668

-------------------------------------------------------

| Id | Operation | Name | Rows | Bytes |

-------------------------------------------------------

| 0 | SELECT STATEMENT | | 15 | 450 |

| 1 | SORT ORDER BY | | 15 | 450 |

| 2 | TABLE ACCESS FULL| T_NOSORT | 15 | 450 |

-------------------------------------------------------

QL> SELECT /*+ INDEX(T_NOSORT IND_T_NOSORT_NAME) */ ID, NAME FROM T_NOSORT ORDER BY NAME;

| Id  | Operation                   | Name              | Rows  | Bytes | Cost (%CPU)| Time     |

-------------------------------------------------------------------------------|   0 | SELECT STATEMENT          |                   |    41 |  1230 |   827   (1)| 00:00:10 |

|   1 |  TABLE ACCESS BY INDEX ROWID| T_NOSORT          |    41 |  1230 |   827   (1)| 00:00:10 |

|   2 |   INDEX FULL SCAN           | IND_T_NOSORT_NAME |    41 |       |    26   (0)| 00:00:01 |

利用索引范围扫描

SQL> SELECT ID, NAME FROM T_NOSORT WHERE NAME < 'I' ORDER BY NAME;

----------------------------------------------------------

Plan hash value: 1041838668

-------------------------------------------------------

| Id | Operation | Name | Rows | Bytes |

-------------------------------------------------------

| 0 | SELECT STATEMENT | | 9 | 270 |

| 1 | SORT ORDER BY | | 9 | 270 |

|* 2 | TABLE ACCESS FULL| T_NOSORT | 9 | 270 |

-------------------------------------------------------

Predicate Information (identified by operation id):

---------------------------------------------------

2 - filter("NAME"<'I')

SQL> SELECT /*+ INDEX(T_NOSORT IND_T_NOSORT_NAME) */ ID, NAME 

2 FROM T_NOSORT WHERE NAME < 'I' ORDER BY NAME;

----------------------------------------------------------

Plan hash value: 919790285

-------------------------------------------------------------------------

| Id | Operation | Name | Rows | Bytes |

-------------------------------------------------------------------------

| 0 | SELECT STATEMENT | | 9 | 270 |

| 1 | TABLE ACCESS BY INDEX ROWID| T_NOSORT | 9 | 270 |

|* 2 | INDEX RANGE SCAN | IND_T_NOSORT_NAME | 9 | |

-------------------------------------------------------------------------

Predicate Information (identified by operation id):

---------------------------------------------------

2 - access("NAME"<'I')

filter("NAME"<'I')

如果是倒序排序

QL> SELECT /*+ INDEX_DESC(T_NOSORT IND_T_NOSORT_NAME) */ ID, NAME 

2 FROM T_NOSORT ORDER BY NAME DESC;

----------------------------------------------------------

Plan hash value: 2858378269

-------------------------------------------------------------------------

| Id | Operation | Name | Rows | Bytes |

-------------------------------------------------------------------------

| 0 | SELECT STATEMENT | | 15 | 450 |

| 1 | TABLE ACCESS BY INDEX ROWID| T_NOSORT | 15 | 450 |

| 2 | INDEX FULL SCAN DESCENDING| IND_T_NOSORT_NAME | 15 | |

-------------------------------------------------------------------------

这里只是说明了能够避免排序的执行计划，但是不一定能提升性能

上面针对于单表

MERGE JOIN连接方式

SQL> CREATE TABLE T1 (ID NUMBER PRIMARY KEY, NAME VARCHAR2(30) NOT NULL);

SQL> CREATE TABLE T2 (ID NUMBER, NAME VARCHAR2(30));

SQL> CREATE INDEX IND_T1_NAME ON T1(NAME);

SQL> INSERT INTO T1 SELECT ROWNUM, TABLE_NAME FROM USER_TABLES;

SQL> INSERT INTO T2 SELECT ROWNUM, OBJECT_NAME FROM USER_OBJECTS;

SQL> COMMIT;

SQL> SET AUTOT ON EXP

SQL> SELECT /*+ USE_MERGE(T1, T2) */ T2.NAME, T1.ID FROM T1, T2

 WHERE T1.NAME = T2.NAME ;

| Id  | Operation           | Name | Rows  | Bytes | Cost (%CPU)| Time     |

----------------------------------------------------------------------------

|   0 | SELECT STATEMENT    |      |    41 |  1927 |     8  (25)| 00:00:01 |

|   1 |  MERGE JOIN         |      |    41 |  1927 |     8  (25)| 00:00:01 |

|   2 |   SORT JOIN         |      |    41 |  1230 |     4  (25)| 00:00:01 |

|   3 |    TABLE ACCESS FULL| T1   |    41 |  1230 |     3   (0)| 00:00:01 |

|*  4 |   SORT JOIN         |      |    99 |  1683 |     4  (25)| 00:00:01 |

|   5 |    TABLE ACCESS FULL| T2   |    99 |  1683 |     3   (0)| 00:00:01 |

----------------------------------------------------

Predicate Information (identified by operation id):

---------------------------------------------------

4 - access("T1"."NAME"="T2"."NAME")

filter("T1"."NAME"="T2"."NAME")

SQL> SELECT /*+ USE_MERGE(T2, T1) */ T2.NAME, T1.ID

 FROM T1, T2 WHERE T1.NAME = T2.NAME ORDER BY T2.NAME ;

----------------------------------------------------

Plan hash value: 412793182

----------------------------------------------------

| Id | Operation | Name | Rows | Bytes |

----------------------------------------------------

| 0 | SELECT STATEMENT | | 19 | 893 |

| 1 | MERGE JOIN | | 19 | 893 |

| 2 | SORT JOIN | | 17 | 510 |

| 3 | TABLE ACCESS FULL| T1 | 17 | 510 |

|* 4 | SORT JOIN | | 97 | 1649 |

| 5 | TABLE ACCESS FULL| T2 | 97 | 1649 |

----------------------------------------------------

Predicate Information (identified by operation id):

---------------------------------------------------

4 - access("T1"."NAME"="T2"."NAME")

filter("T1"."NAME"="T2"."NAME")

针对merge join只能对连接的列排序，且排序操作只能是升序

SQL> SELECT /*+ USE_MERGE(T2, T1) */ T2.NAME, T1.ID

 FROM T1, T2 WHERE T1.NAME = T2.NAME ORDER BY T2.NAME DESC;

|   0 | SELECT STATEMENT     |      |    41 |  1927 |     9  (34)| 00:00:01 |

|   1 |  SORT ORDER BY       |      |    41 |  1927 |     9  (34)| 00:00:01 |

|   2 |   MERGE JOIN         |      |    41 |  1927 |     8  (25)| 00:00:01 |

|   3 |    SORT JOIN         |      |    41 |  1230 |     4  (25)| 00:00:01 |

|   4 |     TABLE ACCESS FULL| T1   |    41 |  1230 |     3   (0)| 00:00:01 |

|*  5 |    SORT JOIN         |      |    99 |  1683 |     4  (25)| 00:00:01 |

|   6 |     TABLE ACCESS FULL| T2   |    99 |  1683 |     3   (0)| 00:00:01 |5 - access("T1"."NAME"="T2"."NAME")

filter("T1"."NAME"="T2"."NAME")

NESTED LOOP连接

由于nested loop不会对操作结果排序，所以结果是无序的

如果驱动表在连接前是有序的，在连接后，结果还是有序的

SQL> CREATE INDEX IND_T2_ID ON T2(ID);

SQL> CREATE INDEX IND_T2_NAME ON T2(NAME);

SQL> SELECT /*+ USE_NL(T1, T2) */ T1.ID, T1.NAME, T2.NAME 

2 FROM T1, T2

3 WHERE T1.ID = T2.ID

4 ;

----------------------------------------------------------

Plan hash value: 3621112097

----------------------------------------------------------------------

| Id | Operation | Name | Rows | Bytes | Cost

----------------------------------------------------------------------

| 0 | SELECT STATEMENT | | 17 | 1020 | 

| 1 | TABLE ACCESS BY INDEX ROWID| T2 | 1 | 30 | 

| 2 | NESTED LOOPS | | 17 | 1020 | 

| 3 | TABLE ACCESS FULL | T1 | 17 | 510 | 

|* 4 | INDEX RANGE SCAN | IND_T2_ID | 1 | | 

----------------------------------------------------------------------

Predicate Information (identified by operation id):

---------------------------------------------------

4 - access("T1"."ID"="T2"."ID")

SQL> SELECT /*+ ORDERED INDEX(T1 IND_T1_NAME) USE_NL(T1, T2) */ 

2 T1.ID, T1.NAME, T2.NAME 

3 FROM T1, T2

4 WHERE T1.ID = T2.ID

5 ORDER BY T1.NAME

6 ;

----------------------------------------------------------

Plan hash value: 1062594094

---------------------------------------------------------------------

| Id | Operation | Name | Rows | Bytes |

---------------------------------------------------------------------

| 0 | SELECT STATEMENT | | 17 | 1020 |

| 1 | TABLE ACCESS BY INDEX ROWID | T2 | 1 | 30 |

| 2 | NESTED LOOPS | | 17 | 1020 |

| 3 | TABLE ACCESS BY INDEX ROWID| T1 | 17 | 510 |

| 4 | INDEX FULL SCAN | IND_T1_NAME | 17 | |

|* 5 | INDEX RANGE SCAN | IND_T2_ID | 1 | |

---------------------------------------------------------------------

Predicate Information (identified by operation id):

---------------------------------------------------

5 - access("T1"."ID"="T2"."ID")

SQL> ALTER TABLE T2 MODIFY NAME NOT NULL;

SQL> CREATE INDEX IND_T2_NAME ON T2(NAME);

SQL> SET AUTOT OFF

SQL> UPDATE T2 SET ID = MOD(ID, 17) + 1;

SQL> COMMIT;

SQL> SET AUTOT ON EXP

SQL> SELECT /*+ ORDERED INDEX(T1 IND_T1_NAME) 

2 INDEX(T2 IND_T2_NAME) USE_NL(T1, T2) */ 

3 T1.ID, T1.NAME, T2.NAME 

4 FROM T1, T2

5 WHERE T1.ID = T2.ID

6 ORDER BY T1.NAME

7 ;

----------------------------------------------------------

Plan hash value: 3719138605

---------------------------------------------------------------------

| Id | Operation | Name | Rows | Bytes |

---------------------------------------------------------------------

| 0 | SELECT STATEMENT | | 97 | 5820 |

|* 1 | TABLE ACCESS BY INDEX ROWID | T2 | 6 | 180 |

| 2 | NESTED LOOPS | | 97 | 5820 |

| 3 | TABLE ACCESS BY INDEX ROWID| T1 | 17 | 510 |

| 4 | INDEX FULL SCAN | IND_T1_NAME | 17 | |

| 5 | INDEX FULL SCAN | IND_T2_NAME | 97 | |

---------------------------------------------------------------------

Predicate Information (identified by operation id):

---------------------------------------------------

1 - filter("T1"."ID"="T2"."ID")

SQL> SELECT /*+ ORDERED INDEX(T1 IND_T1_NAME) 

2 INDEX_DESC(T2 IND_T2_NAME) USE_NL(T1, T2) */ 

3 T1.ID, T1.NAME, T2.NAME 

4 FROM T1, T2

5 WHERE T1.ID = T2.ID

6 ORDER BY T1.NAME

7 ;

----------------------------------------------------------

Plan hash value: 2531946081

---------------------------------------------------------------------

| Id | Operation | Name | Rows | Bytes |

---------------------------------------------------------------------

| 0 | SELECT STATEMENT | | 97 | 5820 |

|* 1 | TABLE ACCESS BY INDEX ROWID | T2 | 6 | 180 |

| 2 | NESTED LOOPS | | 97 | 5820 |

| 3 | TABLE ACCESS BY INDEX ROWID| T1 | 17 | 510 |

| 4 | INDEX FULL SCAN | IND_T1_NAME | 17 | |

| 5 | INDEX FULL SCAN DESCENDING | IND_T2_NAME | 97 | |

---------------------------------------------------------------------

Predicate Information (identified by operation id):

---------------------------------------------------

1 - filter("T1"."ID"="T2"."ID")

SQL> SELECT /*+ ORDERED INDEX(T1 IND_T1_NAME) 

2 INDEX(T2 IND_T2_NAME) USE_NL(T1, T2) */ 

3 T1.ID, T1.NAME, T2.NAME 

4 FROM T1, T2

5 WHERE T1.ID = T2.ID

6 ORDER BY T1.NAME, T2.NAME DESC

7 ;

----------------------------------------------------------

Plan hash value: 1438746903

----------------------------------------------------------------------

| Id | Operation | Name | Rows | Bytes |

----------------------------------------------------------------------

| 0 | SELECT STATEMENT | | 97 | 5820 |

| 1 | SORT ORDER BY | | 97 | 5820 |

|* 2 | TABLE ACCESS BY INDEX ROWID | T2 | 6 | 180 |

| 3 | NESTED LOOPS | | 97 | 5820 |

| 4 | TABLE ACCESS BY INDEX ROWID| T1 | 17 | 510 |

| 5 | INDEX FULL SCAN | IND_T1_NAME | 17 | |

| 6 | INDEX FULL SCAN | IND_T2_NAME | 97 | |

----------------------------------------------------------------------

Predicate Information (identified by operation id):

---------------------------------------------------

2 - filter("T1"."ID"="T2"."ID")

Oracle 利用执行计划来避免排序操作的更多相关文章

Oracle sql执行计划解析
Oracle sql执行计划解析 https://blog.csdn.net/xybelieve1990/article/details/50562963 Oracle优化器 Oracle的优化器共有 ...
怎样看懂Oracle的执行计划
怎样看懂Oracle的执行计划一.什么是执行计划 An explain plan is a representation of the access path that is taken when ...
（转）Oracle定时执行计划任务
Oracle定时执行计划任务在日常工作中,往往有些事情是需要经常重复地做的,例如每天更新业务报表.每天从数据库中提取符合条件的数据.每天将客户关系管理系统中的数据分配给员工做数据库营销……因此我们就 ...
【ORACLE】记录通过执行Oracle的执行计划查询SQL脚本中的效率问题
记录通过执行Oracle的执行计划查询SQL脚本中的效率问题问题现象: STARiBOSS5.8.1R2版本中,河北对帐JOB执行时,无法生成发票对帐文件. 首先,Quartz表达式培植的启 ...
Oracle的执行计划（来自百度文库）
如何开启oracle执行计划 http://wenku.baidu.com/view/7d1ff6bc960590c69ec37636.html怎样看懂Oracle的执行计划 http://wenku ...
ORACLE的执行计划
转自:http://www.cnblogs.com/lovingprince/archive/2007/12/07/2166400.html 背景知识: 为了更好的进行下面的内容我们必须 ...
oracle 理解执行计划
·BUFFER SORT是BUFFER却不是SORT 用AUTOTRACE查看执行的计划的同学常问到执行计划里的BUFFER SORT是什么意思,这里为什么要排序呢? BUFFER SORT不是一种排 ...
分析oracle的执行计划（explain plan）并对对sql进行优化实践
基于oracle的应用系统很多性能问题,是由应用系统sql性能低劣引起的,所以,sql的性能优化很重要,分析与优化sql的性能我们一般通过查看该sql的执行计划,本文就如何看懂执行计划,以及如何通过分 ...
oracle sql 执行计划分析
转自http://itindex.net/detail/45962-oracle-sql-%E8%AE%A1%E5%88%92 一.首先创建表 SQL> show user USER is &q ...

随机推荐

【LABVIEW到C#】3》String的操作之Match Pattern Funtion.vi
C#实现如下 using System; using System.Collections.Generic; using System.Text; using System.Text.RegularE ...
websocket之django简单使用
WebSocket protocol: WebSocket protocol 是HTML5一种新的协议.它是实现了浏览器与服务器全双工通信(full-duplex).HTML5定义了WebSocket ...
第一章 Burp Suite 安装和环境配置
Burp Suite是一个集成化的渗透测试工具,它集合了多种渗透测试组件,使我们自动化地或手工地能更好的完成对web应用的渗透测试和攻击.在渗透测试中,我们使用Burp Suite将使得测试工作变得更 ...
【译】：python中的colorlog库
本文翻译自colorlog官方文档一. 描述 colorlog.ColoredFormatter是一个Python logging模块的格式化,用于在终端输出日志的颜色二. 安装 pip inst ...
【转】安装Ubuntu时卡在logo界面
Ubuntu15.04 安装卡在logo界面不动,进度点卡死不动,原因主要是双显卡,电源设置项默认不合理,导致安装失败. 选择USB硬盘(uefi),进入到一个有四个选项的界面,分别是 1,try U ...
【ccf2017-12-2】游戏(模拟)
问题描述有n个小朋友围成一圈玩游戏,小朋友从1至n编号,2号小朋友坐在1号小朋友的顺时针方向,3号小朋友坐在2号小朋友的顺时针方向,……,1号小朋友坐在n号小朋友的顺时针方向. 游戏开始,从1号小朋 ...
ubuntu下安装交叉编译工具链
/usr/localmkdir arm 将文件file1复制成文件file2 cp file1 file2 /cp /mnt/hgfs/UbuntuGX/arm-2008q3-linux.tar.gz ...
L134
这种成功和后来的研究(表明记忆本身并不是先天决定的)使爱立信总结到,记忆的行为与其说是一种习得的行为不如说是一种先天的行为. 这点我们不清楚-构思物体和找出数字模型的能力,回答问题(最好的诗人和哲学家 ...
Qt中内存泄露和退出崩溃的问题
http://blog.csdn.net/wangkuiyun/article/details/7412379
Java并发编程总结
基础概念 1.什么是原子操作?在Java Concurrency API中有哪些原子类(atomic classes)?原子操作(atomic operation)意为"不可被中断的一个或一 ...

Oracle 利用执行计划来避免排序操作

MERGE JOIN连接方式

NESTED LOOP连接

Oracle 利用执行计划来避免排序操作的更多相关文章

随机推荐

热门专题