SQL Tuning Proven Methodologies

Transcription

1 SQL Tuning Proven Methodologies V.Hariharaputhran

2 V.Hariharaputhran o Twelve years in Oracle Development / DBA / Big Data / Cloud Technologies o All India Oracle Users Group (AIOUG) Evangelist o Passion to learn and share o Blog: o

3 Our 60 minutes Agenda Objective Lifecycle of a SQL Cursors Why and What Get the right Execution Plan Case Studies Push predicate vs. No-Push Join Elimination Correlated sub-query Why my Index is not Used Take Away

4 Until Yesterday it was running Fine What happened now? DBA Developer

5 Typical Day Options we see 1. Why not Cache Table 2. There is Memory Problem / No partition hence you are bound to run slow 3. I learnt new features and desperate to implement them 4. Rewrite the SQL / Add Index / 5. SQL running slow Found the init parameter causing it, Let me change it. 6. I see no Histograms / must be a stats problem 7. I came across a tool, you just have to provide the table name it would generate the SQL for us.

6 Out of the BOX Recreate the Table Avoid writing the SQL / Change the Design Archive Strategy

7 SQL Lifecycle Parse Bind Execute Fetch

8 Some more Parse PARSE So what is before the syntax check Adding VPD Predicates to SQL

9 VPD Watch out for the Predicate Info

10 Why add VPD first

11 More about Parsing Syntax Check - Keywords Semantic Check - Objects Accessible View Merging/Subquery Unnesting Views to Base tables / Inline Views Query Transformation Transitivity Optimization Soft Parse Hard Parse Query Execution Plan / Load into Library Cache

12 Cursor SELECT * FROM EMP ENV STATS SQL TEXT BIND VARIABLES PARENT CURSOR CHILD CURSOR

13 Cursors

14 What is this Child Number = 0?

15

16 Identify the reason for Child Cursor

17 declare v_ename emp.ename%type; begin For x in loop select /* NORMAL */ ename into v_ename from Binding in PLSQL emp where empno = x ; end loop; end; / declare v_ename emp.ename%type; v_sql varchar2(200); begin For x in loop execute immediate 'select /* bind */ ename from emp where empno = :v_empno' into v_ename using x ; end loop; end; / In PL/SQL its free, Oracle does the binding for us

18 Explain Plan

19 Is X not a Number?

20 Estimate Vs Actual

21 Autotrace

22 Autotrace 20000/3=6666.6

23 Explain Plan Not the Real Plan, Just an estimate Treat all Bind Variable as Varchar2 Datatype Does not use Bind Variable Peeking

24 DBMS_XPLAN DBMS_XPLAN.display - Estimated DBMS_XPLAN.display_cursor Real from Memory DBMS_XPLAN.display_awr - Historic

25 CASE STUDY -1

26 Estimated Plan from DBMS_XPLAN SQL> select * from tblchk tbl1 where exists 2 (select 1 from tblchk tbl2 where tbl1.id=tbl2.id and tbl2.id_val='aioug'); no rows selected SQL> select * from table(dbms_xplan.display_cursor()); Id Operation Name Rows Bytes Cost (%CPU) Time SELECT STATEMENT 1 (100) * 1 FILTER * 2 HASH JOIN RIGHT SEMI 190K 2226K 207 (2) 00:00:01 * 3 TABLE ACCESS FULL TBLCHK K 103 (1) 00:00:01 4 TABLE ACCESS FULL TBLCHK 220K 1289K 103 (1) 00:00: Predicate Information (identified by operation id): filter(null IS NOT NULL) 2 - access("tbl1"."id"="tbl2"."id") 3 - filter("tbl2"."id_val"='aioug')

27 God TKprof call count cpu elapsed disk query current rows Parse Execute Fetch total Misses in library cache during parse: 1 Optimizer mode: ALL_ROWS Parsing user id: 143 Number of plan statistics captured: 1 Rows (1st) Rows (avg) Rows (max) Row Source Operation HASH JOIN RIGHT SEMI (cr=487 pr=483 pw=0 time= us cost=207 size= card=190008) TABLE ACCESS FULL TBLCHK (cr=487 pr=483 pw=0 time= us cost=103 size= card=36663) TABLE ACCESS FULL TBLCHK (cr=0 pr=0 pw=0 time=0 us cost=103 size= card=220000) Elapsed times include waiting on following events: Event waited on Times Max. Wait Total Waited Waited SQL*Net message to client Disk file operations I/O db file sequential read db file scattered read SQL*Net message from client

28 Add the Check Constraint SQL> select distinct id_val from tblchk; ID_VAL A B C alter table tblchk add CONSTRAINT check_idval CHECK (id_val in ('A','B','C'));

29 After Constraint TKprof call count cpu elapsed disk query current rows Parse Execute Fetch total Misses in library cache during parse: 1 Optimizer mode: ALL_ROWS Parsing user id: 143 Number of plan statistics captured: 1 Rows (1st) Rows (avg) Rows (max) Row Source Operation FILTER (cr=0 pr=0 pw=0 time=7 us) HASH JOIN RIGHT SEMI (cr=0 pr=0 pw=0 time=0 us cost=276 size= card=257840) TABLE ACCESS FULL TBLCHK (cr=0 pr=0 pw=0 time=0 us cost=138 size= card=46662) TABLE ACCESS FULL TBLCHK (cr=0 pr=0 pw=0 time=0 us cost=137 size= card=280000) Elapsed times include waiting on following events: Event waited on Times Max. Wait Total Waited Waited SQL*Net message to client SQL*Net message from client

30 DBMS_XPLAN ALLSTATS LAST Rows = Num_Rows / No of Distinct records in ID_VAL More v$sql_plan_statistics_all

31 Explain Plan Access Method Table Scan / Index Join Method NL/Hash/Sort Merge Join Order Order in which tables are joined Join Type Anti / Semi / Outer Partition Pruning What partitions are used Parallel Execution Predicate / Column Projections Memory Stats 0/1/M

32 Full table Scan Majority Rows + Columns Scans up to HWM Multi block Reads Candidate for Parallel Execution

33 FTS with Filter

34 Index Fast Full Scan Not Going to Table

35 Index Unique Scan Not Going to Table

36 Index to Table

37 Transform SQL to semantically equivalent SQL - WHY Processed more efficiently Better Plan. I wrote this way because it easy for me, I can develop the application Faster

38 Query Transformation View Merging

39 CREATE VIEW V_EMP_SAL AS SELECT * FROM EMP WHERE SAL>100; View Merging SELECT EMP_ID FROM V_EMP_SAL WHERE DEPTNO = 10; SELECT * FROM EMP WHERE SAL>100 AND DEPTNO = 10; ROWNUM PSEUDOCOLUMN SET OPERATORS UNION UNION ALL INTERSECT MINUS CONNECT BY CLAUSE

40 Transitivity

41 SELECT T1.COL1, T2.COL2 FROM TBL1 T1, TBL2 T2 WHERE T1.COL1 = T2.COL1 AND T1.COL1 = 100; Transitivity SELECT T1.COL1, T2.COL2 FROM TBL1 T1, TBL2 T2 WHERE T1.COL1 = T2.COL1 AND T1.COL1 = 100 AND T2.COL1 = 100;

42 Subquery Unnesting

43 SELECT E.EMPNO, E.DEPTNO FROM EMP E WHERE E.DEPTNO IN (SELECT D.DEPTNO FROM DEPT D WHERE D.LOC = 'CHICAGO') Subquery Unnesting SELECT E.EMPNO EMPNO,E.DEPTNO DEPTNO FROM HARI.EMP E WHERE E.DEPTNO=ANY (SELECT D.DEPTNO DEPTNO FROM HARI.DEPT D WHERE D.LOC='CHICAGO') SELECT E.EMPNO EMPNO,E.DEPTNO DEPTNO FROM HARI.DEPT D,HARI.EMP E WHERE E.DEPTNO=D.DEPTNO AND D.LOC='CHICAGO'

44 Complex View Merging

45 SELECT D.DNAME, D.DEPTNO,VW.DEPT_AVG_SAL FROM DEPT D, VW_AVG_SAL VW WHERE D.DEPTNO = VW.DEPTNO AND D.LOC = 'CHICAGO'; SELECT D.DNAME,D.DEPTNO, AVG(EMP.SAL) DEPT_AVG_SAL FROM HARI.DEPT D,HARI.EMP EMP WHERE D.DEPTNO=EMP.DEPTNO AND D.LOC='CHICAGO' GROUP BY D.ROWID,D.DEPTNO,D.DNAME Complex View Merging SELECT D.DNAME DNAME,D.DEPTNO DEPTNO, VW.DEPT_AVG_SAL DEPT_AVG_SAL FROM HARI.DEPT D, ( SELECT EMP.DEPTNO DEPTNO, AVG(EMP.SAL) DEPT_AVG_SAL FROM HARI.EMP EMP GROUP BY EMP.DEPTNO ) VW WHERE D.DEPTNO=VW.DEPTNO AND D.LOC='CHICAGO'

46 Push Predicates

47 CREATE OR REPLACE VIEW V_EMP_UNION AS SELECT ENAME, EMPNO FROM EMP E1 WHERE DEPTNO <20 UNION SELECT ENAME, EMPNO FROM EMP E2 WHERE DEPTNO >30; SELECT * FROM VW_EMP_UNION WHERE EMPNO > 7788 SELECT * FROM ( SELECT ENAME, EMPNO FROM EMP E1 WHERE DEPTNO <20 AND EMPNO > 7788 UNION SELECT ENAME, EMPNO FROM EMP E2 WHERE DEPTNO >30 AND EMPNO > 7788 ) ; ; * Push Predicates

48 Do You Know (DYK) How many row source can be joined together at a time? TWO In a Full Table Scan up to what point oracle scans all the blocks in a table? HWM Hash or Sort-Merge which is more efficient in general? HASH

49 Join Methods

50 SORT MERGE JOIN

51 SORT MERGE JOIN

52 Join Type Nested Loop Retrieves row from one source and find its corresponding one from another source Hash Join Build Hash Table in memory for smaller row source Go through the other source and uses Hash function on Join Columns

53 select empno from emp where empno like '11'; Do You Know (DYK) How will my predicate info look like? select * from dept where loc like '%CHENNAI'; This operator can be used instead OR clause. How will my predicate info look like? UNION,Even after having DISTINCT clause in the query, SORT UNIQUE is not done by the Optimizer. If the Data doesn't have duplicates

54 Case Study - Correlated Subquery

55 In Action Correlated Subquery SELECT * FROM TAB1 WHERE EXISTS (SELECT 1 FROM TAB2 WHERE TAB2.COL1 = TAB1.COL1)

56

57 Not Using my Index

58

59 Number <-> Varchar

60 Fix the Datatype

61

62 Approach of Datatype Change now - Impacts the Existing Code Don t Forget the Learning TO_Number Function

63 Correlated Subquery is the problem, do you know how it works? You should not use Correlated subquery, rewrite it with NOT IN OK?

64 IS NOT EXISTS = NOT IN?

65

66

67 Lets us dig more Data & Facts

68 NOT EXISTS ANTI JOIN

69 NOT IN ANTI JOIN

70 NOT EXISTS NOT IN ORDERS ******** SINGLE TABLE ACCESS PATH Single Table Cardinality Estimation for ORDERS[O] Table: ORDERS Alias: O Access Path: TableScan Cost: Access Path: index (FullScan) Index: PK_ORDER Cost: Best:: AccessPath: TableScan Cost: ORDERS ******** Single Table Cardinality Estimation for ORDERS[O] Table: ORDERS Alias: O Access Path: TableScan Cost: Access Path: index (FFS) Cost: index filter:"o"."book_id" IS NOT NULL Best:: AccessPath: IndexFFS Index: IDX_ORDERS1 Cost:

71 Does Index Store NULL Values

72 Back to Basics Fast Full Index Scan multiple blocks from disk in a single I/O Cost = No of blocks to be scanned + MBRC value Reads the index blocks in no particular order Accesses the data in the index itself, without accessing the table

73 Fast Full Index Scan Accesses the data in the index itself, without accessing the table

74

75 Can I do it even better Yes, Why not at the Design Stage Enforce referential Integrity Mark Columns as NOT NULL Index the Foreign Key Column

76 I have a CTD After Datatype Correction

77 CTD cont

78 Recap View Merging/Subquery Unnesting Views to Base tables / Inline Views Query Transformation Transitivity Optimization Query Execution Plan

79 Until Yesterday it was running Fine What happened now? DBA Developer Start Comparing Old Plan and New Plan Analyze the Data and understand what has changed The above 2 would help you to dig further

80 References ( NOT IN with NULL Values) Gaja Krishna Vaidyanatha CTD,TKPROF Options - Exadata Performance Mgmt AIOUG Chennai Chapter

81 Thanks