No_expand hint 解决CBO针对where...or..语句中的cardinality计算问题

        在where...or..语句中，CBO在计算关联cardinality数量中，会产生计算的偏差，从而造成语句效率低下，通常我们解决的办法：
       1、重写SQL语句
       2、加no_expand hint

      以下是从原理上分析CBO造成计算cardinality错误的原因。

     1、创建测试脚本

SQL>execute dbms_random.seed(0)
SQL>create table t1
           as
           select
                 trunc(dbms_random.value(0, 30 ))    join1,
                 trunc(dbms_random.value(0, 50 ))    join2,
                 lpad(rownum,10)                v1,
                  rpad('x',100)                padding
            from
                 all_objects
            where
                rownum <= 10000;

SQL>create table t2
          as
          select
                trunc(dbms_random.value(0, 40 ))    join1,
                trunc(dbms_random.value(0, 40 ))    join2,
                lpad(rownum,10)                v1,
                rpad('x',100)                padding
          from
                all_objects
          where
               rownum <= 10000;

2、统计分析（略）

3、查看执行计划
SQL>set autotrace traceonly explain
SQL>select
                 t1.v1, t2.v1
           from
                 t1,
                 t2
           where
                   t2.join1 = t1.join1
           or    t2.join2 = t1.join2;

Execution Plan
-----------------------------------------------------------------------------------------------------------
| Id  | Operation                          | Name | Rows  | Bytes | Cost (%CPU)| Time     |
------------------------------------------------------------------------------------------------------------
|   0 | SELECT STATEMENT    |              |  2125K|    68M|   210  (24)| 00:00:03 |
|   1 |  CONCATENATION         |              |              |            |                   |                  |
|*  2 |   HASH JOIN                    |              |  2000K|     64M|   102  (22)| 00:00:02 |
|   3 |    TABLE ACCESS FULL|       T1   | 10000 |   166K|      40   (0)| 00:00:01 |
|   4 |    TABLE ACCESS FULL|       T2   | 10000 |   166K|      40   (0)| 00:00:01 |
|*  5 |   HASH JOIN                    |               |    125K|  4150K|   108  (26)| 00:00:02 |
|   6 |    TABLE ACCESS FULL|        T1   | 10000 |   166K|    40   (0)| 00:00:01 |
|   7 |    TABLE ACCESS FULL|        T2   | 10000 |   166K|    40   (0)| 00:00:01 |
----------------------------------------------------------------------------
Predicate Information (identified by operation id):
---------------------------------------------------

   2 - access("T2"."JOIN2"="T1"."JOIN2")
   5 - access("T2"."JOIN1"="T1"."JOIN1")
        filter(LNNVL("T2"."JOIN2"="T1"."JOIN2"))

分析并计算：
A、SQL语句变成CONCATENATION方式，从predicate information中看到filter(LNNVL( ))，lnnvl(predicate) 如果predicate 是 false 或 nul，将返回True
 
B、第一个hash join的Rows计算
   
Join Selectivity(t2.join2=t1.join2)=
                       ((t1.num_rows(join2) - t1.null(join2))/t1.num_rows) *
                       ((t2.num_rows(join2) - t2.null(join2))/t2.num_rows) *
                        1/max(t1.distinct_value(join2), t2.distinct_value(join2)
                    =((10000-0)/10000) * (10000-0)/10000) * 1/max(40,50)
                    =1/50
Join cardinality(t2.join2=t1.join2) =
                           filter(t1) * filter(t2)* Join Selectivity(t2.join2=t1.join2)
                      = 10000 * 10000 * 1/50
                      =2000000 = 2000K
与执行计划 id =2 输出结果一致

 C、第二个hash join的Rows计算
    从以上可以看出包含两个预测：
              5 - access("T2"."JOIN1"="T1"."JOIN1")
                    filter(LNNVL("T2"."JOIN2"="T1"."JOIN2"))
     所以
      Join Selectivity= Join Selectivity(t2.join1=t1.join1) *
                                    Join Selectivity(LNNVL(t2.join2 = t1.join2))

      如上计算方法
      Join Selectivity(t2.join1=t1.join1) = 1/max(30,40) = 1/40

      而Join Selectivity(LNNVL(t2.join2 = t1.join2))计算是以5%(捆绑变量方式计算)
  
      从而：
         join Selectivity = 1/40*5%=1/800
 
         Join cardinality = 10000 * 10000 * 1/800 = 125K

 不难看出，造成计算偏差的是由于CBO在进行预测的时候，转化了filter，并评估其Selectivity为5%造成的结果，从而使整个执行计划中的rows值与实际相差巨大。

4、解决办法1：重写SQL语句

SQL>select    t1.v1, t2.v1
           from  t1, t2
           where
                  t2.join2 = t1.join2
           union all
           select    t1.v1, t2.v1
           from t1, t2
           where
                      t2.join1 = t1.join1
           and    t2.join2 != t1.join2;

Execution Plan
-----------------------------------------------------------------------------------------------------
| Id  | Operation                           | Name | Rows  | Bytes | Cost (%CPU)| Time     |
----------------------------------------------------------------------------
|   0 | SELECT STATEMENT     |             |  4450K|   132M|   210  (62)| 00:00:03 |
|   1 |  UNION-ALL                       |             |              |             |                   |                    |
|*  2 |   HASH JOIN                      |             |  2000K|     53M|   102  (22)| 00:00:02 |
|   3 |    TABLE ACCESS FULL  |      T1   | 10000 |   136K|      40   (0)| 00:00:01 |
|   4 |    TABLE ACCESS FULL   |     T2   | 10000 |   136K|      40   (0)| 00:00:01 |
|*  5 |   HASH JOIN                       |             |  2450K|    79M|     108  (26)| 00:00:02 |
|   6 |    TABLE ACCESS FULL   |      T1   | 10000 |   166K|      40   (0)| 00:00:01 |
|   7 |    TABLE ACCESS FULL   |      T2   | 10000 |   166K|      40   (0)| 00:00:01 |
---------------------------------------------------------------------------------------------------------

Predicate Information (identified by operation id):
---------------------------------------------------

   2 - access("T2"."JOIN2"="T1"."JOIN2")
   5 - access("T2"."JOIN1"="T1"."JOIN1")
       filter("T2"."JOIN2"<>"T1"."JOIN2")

分析并计算：

A. Join Selectivity(t2.join2 = t1.join2)的计算公式如上所描述等于1/50
     Join Cardinanlity(t2.join2 = t1.join2) = 2000K

B. 关键是在filter中已经发生了变化,从 filter(LNNVL("T2"."JOIN2"="T1"."JOIN2"))变成了filter("T2"."JOIN2"<>"T1"."JOIN2")，所以也造成了计算的差异

   Join Selectivity( ID=5) = Join Selectivity (t2.join1 = t1.join1) *
                                              Join Selectivity(t2.join2<>t1join2)
  
   Join Selectivity (t2.join1 = t1.join1) = 1/max(30,40) = 1/40
   Join Selectivity(t2.join2<>t1join2) = 1 - Join Selectivity(t2.join2 =t1join2)
                                                               = 1-1/50=49/50

   Join Selectivity( ID=5) = 1/40*49/50 = 49/2000 = 0.0245

   Join Cardinanlity(ID=5) = 10000 * 10000 * 0.0245 = 2450K
  
5、解决办法2：添加no_expand hint
SQL>select  /*+ no_expand */
                   t1.v1, t2.v1
            from  t1,  t2
           where
                   t2.join1 = t1.join1
           or    t2.join2 = t1.join2;
          
  Execution Plan
---------------------------------------------------------------------------------------------------------
| Id  | Operation                          | Name  |  Rows  | Bytes | Cost (%CPU)| Time     |
---------------------------------------------------------------------------------------------------------
|   0 | SELECT STATEMENT    |               |  4450K|   144M|   381K  (1)| 01:16:22 |
|   1 |  NESTED LOOPS            |               |  4450K|    144M|   381K  (1)| 01:16:22 |
|   2 |   TABLE ACCESS FULL |        T1   | 10000 |    166K|    40   (0)| 00:00:01 |
|*  3 |   TABLE ACCESS FULL |        T2   |     445 |   7565 |    38   (0)| 00:00:01 |
--------------------------------------------------------------------------------------------------------

Predicate Information (identified by operation id):
---------------------------------------------------

   3 - filter("T2"."JOIN1"="T1"."JOIN1" OR "T2"."JOIN2"="T1"."JOIN2")

分析并计算
Join Selectivity(t2.join1= t1.join1 or t2.join2 = t1.join2)
                = Join Selectivity(t2.join1= t1.join1) +
                   Join Selectivity(t2.join2 = t1.join2) -
                   Join Selectivity(t2.join1= t1.join1) *
                   Join Selectivity(t2.join2 = t1.join2)

Join Selectivity(t2.join1 = t1.join1) = 1/max(30,40) = 1/40
Join Selectivity(t2.join2 = t2.join2) = 1/max(40,50) = 1/50

从而
  Join Selectivity(t2.join1= t1.join1 or t2.join2 = t1.join2)
                  = 1/40+1/50-1/40*1/50=89/2000=0.0445
   
  Join Cardinality (ID=3) = 10000 * 0.0445= 445

NL总的Cardinality = 445 * 10000 = 4450k

所以no_expand 的含义是不执行OR-expansion (例如，不使用Concatenation)

注：以上测试脚本来自jonathan lewis 的《CBO》

来自 “ ITPUB博客 ” ，链接：http://blog.itpub.net/354732/viewspace-622563/，如需转载，请注明出处，否则将追究法律责任。

转载于:http://blog.itpub.net/354732/viewspace-622563/