Oracle 索引聚簇因子

--聚合因子试验准备:


--分别建两张有序和无序的表

CREATE TABLE T_COLOCATED ( ID NUMBER, COL2 VARCHAR2(100) );
BEGIN
        FOR I IN 1 .. 100000
        LOOP
            INSERT INTO T_COLOCATED(ID,COL2)
            VALUES (I, RPAD(DBMS_RANDOM.RANDOM,95,'*') );
        END LOOP;
END;
/

ALTER TABLE T_COLOCATED ADD CONSTRAINT PK_T_COLOCATED PRIMARY KEY(ID);

CREATE TABLE T_DISORGANIZED
     AS
    SELECT ID,COL2
    FROM T_COLOCATED
    ORDER BY COL2;

ALTER TABLE T_DISORGANIZED ADD CONSTRAINT PK_T_DISORG PRIMARY KEY (ID);


--分别分析两张表的聚合因子层度


SELECT INDEX_NAME,
              BLEVEL,
              LEAF_BLOCKS,
              NUM_ROWS,
              DISTINCT_KEYS,
              CLUSTERING_FACTOR
         FROM USER_IND_STATISTICS
        WHERE TABLE_NAME IN( 'T_COLOCATED','T_DISORGANIZED');


INDEX_NAME                         BLEVEL LEAF_BLOCKS   NUM_ROWS DISTINCT_KEYS CLUSTERING_FACTOR
------------------------------ ---------- ----------- ---------- ------------- -----------------
PK_T_COLOCATED                          1         208     100000        100000              1469
PK_T_DISORG                             1         208     100000        100000             99935
--首先观察有序表的查询性能




执行并比较性能差异
SQL> select /*+index(t)*/ * from t_colocated t where id>=20000 and id<=40000;
			
			
				已选择20001行。
			
			
				已用时间:  00: 00: 02.73
			
			
				执行计划
----------------------------------------------------------
Plan hash value: 4204525375
			
			
				----------------------------------------------------------------------------------------------
| Id  | Operation                   | Name           | Rows  | Bytes | Cost (%CPU)| Time     |
----------------------------------------------------------------------------------------------
|   0 | SELECT STATEMENT            |                | 22727 |  1442K|   417   (0)| 00:00:06 |
|   1 |  TABLE ACCESS BY INDEX ROWID| T_COLOCATED    | 22727 |  1442K|   417   (0)| 00:00:06 |
|*  2 |   INDEX RANGE SCAN          | PK_T_COLOCATED | 22727 |       |    56   (0)| 00:00:01 |
----------------------------------------------------------------------------------------------
			
			
				Predicate Information (identified by operation id):
---------------------------------------------------
			
			
				   2 - access("ID">=20000 AND "ID"<=40000)
			
			
				Note
-----
   - dynamic sampling used for this statement (level=2)
			
			
				
统计信息
----------------------------------------------------------
          7  recursive calls
          0  db block gets
       3058  consistent gets
         37  physical reads
          0  redo size
    2368473  bytes sent via SQL*Net to client
      15182  bytes received via SQL*Net from client
       1335  SQL*Net roundtrips to/from client
          0  sorts (memory)
          0  sorts (disk)
      20001  rows processed

再观察无序表的查询性能
select /*+index(t)*/ * from t_disorganized t where id>=20000 and id<=40000;

已用时间:  00: 00: 11.51
			
			
				执行计划
----------------------------------------------------------
Plan hash value: 603192320
			
			
				----------------------------------------------------------------------------------------------
| Id  | Operation                   | Name           | Rows  | Bytes | Cost (%CPU)| Time     |
----------------------------------------------------------------------------------------------
|   0 | SELECT STATEMENT            |                | 24048 |  1526K| 20069   (1)| 00:04:01 |
|   1 |  TABLE ACCESS BY INDEX ROWID| T_DISORGANIZED | 24048 |  1526K| 20069   (1)| 00:04:01 |
|*  2 |   INDEX RANGE SCAN          | PK_T_DISORG    | 24048 |       |    46   (0)| 00:00:01 |
----------------------------------------------------------------------------------------------
			
			
				Predicate Information (identified by operation id):
---------------------------------------------------
			
			
				   2 - access("ID">=20000 AND "ID"<=40000)
			
			
				Note
-----
   - dynamic sampling used for this statement (level=2)
			
			
				
统计信息
----------------------------------------------------------
        246  recursive calls
          0  db block gets
      21491  consistent gets
         43  physical reads
          0  redo size
    2368473  bytes sent via SQL*Net to client
      15182  bytes received via SQL*Net from client
       1335  SQL*Net roundtrips to/from client
          6  sorts (memory)
          0  sorts (disk)
      20001  rows processed
--Oracle文档对聚簇因子的解释

Indicates the amount of order of the rows in the table based on the values of the index.
If the value is near the number of blocks, then the table is very well ordered. In this case, the index entries in a single leaf block tend to point to rows in the same data blocks.
If the value is near the number of rows, then the table is very randomly ordered. In this case, it is unlikely that index entries in the same leaf block point to rows in the same data blocks.