Uploaded byTricantinoLopezPerez
6 views

kscope2013vst-130627142814-phpapp02.pdf

This document describes a visualization technique for SQL tuning called Visual SQL Tuning (VST). VST involves drawing the tables involved in a SQL query as nodes and the joins between the tables as connecting lines to show the relationships. It also identifies any filter conditions in the WHERE clause marked on the relevant tables. This visual representation of the tables, joins, and filters can help identify the optimal execution path for the SQL query.

Embed presentation

Download to read offline
1 / 109
2 / 109
3 / 109
4 / 109
5 / 109
6 / 109
7 / 109
8 / 109
9 / 109
10 / 109
11 / 109
12 / 109
13 / 109
14 / 109
15 / 109
16 / 109
17 / 109
18 / 109
19 / 109
20 / 109
21 / 109
22 / 109
23 / 109
24 / 109
25 / 109
26 / 109
27 / 109
28 / 109
29 / 109
30 / 109
31 / 109
32 / 109
33 / 109
34 / 109
35 / 109
36 / 109
37 / 109
38 / 109
39 / 109
40 / 109
41 / 109
42 / 109
43 / 109
44 / 109
45 / 109
46 / 109
47 / 109
48 / 109
49 / 109
50 / 109
51 / 109
52 / 109
53 / 109
54 / 109
55 / 109
56 / 109
57 / 109
58 / 109
59 / 109
60 / 109
61 / 109
62 / 109
63 / 109
64 / 109
65 / 109
66 / 109
67 / 109
68 / 109
69 / 109
70 / 109
71 / 109
72 / 109
73 / 109
74 / 109
75 / 109
76 / 109
77 / 109
78 / 109
79 / 109
80 / 109
81 / 109
82 / 109
83 / 109
84 / 109
85 / 109
86 / 109
87 / 109
88 / 109
89 / 109
90 / 109
91 / 109
92 / 109
93 / 109
94 / 109
95 / 109
96 / 109
97 / 109
98 / 109
99 / 109
100 / 109
101 / 109
102 / 109
103 / 109
104 / 109
105 / 109
106 / 109
107 / 109
108 / 109
109 / 109
Visual SQL Tuning (VST) Kyle Hailey Kscope 2013 New Orleans kylelf@gmail.com http://dboptimizer.com
Who is Kyle Hailey  1990 Oracle – 90 support – 92 Ported v6 – 93 France – 95 Benchmarking – 98 ST Real World Performance  2000 Dot.Com  2001 Quest  2002 Oracle OEM 10g Success! First successful OEM design
Who is Kyle Hailey  1990 Oracle – 90 support – 92 Ported v6 – 93 France – 95 Benchmarking – 98 ST Real World Performance  2000 Dot.Com  2001 Quest a  2002 Oracle OEM 10g  2005 Embarcadero – DB Optimizer
Who is Kyle Hailey • 1990 Oracle  90 support  92 Ported v6  93 France  95 Benchmarking  98 ST Real World Performance • 2000 Dot.Com • 2001 Quest • 2002 Oracle OEM 10g • 2005 Embarcadero  DB Optimizer • 2010 Delphix When not being a Geek - Have a little 4 year old boy who takes up all my time
Typical Architecture Database File system Production Instance Database File system Development Instance Database File system QA Instance Database UAT Instance File system
Clones share duplicate blocks Development Instance Database Instance File system Database QA Instance UAT Instance Database Database Source Database Virtual Databases
SQL Tuning Methodology 1. Find: Problem SQL 2. Study: SQL Execution Plan 3. Fix: How ?
Step 1 : Find “bad” SQL 1. Users complain 2. High Resources 3. Monitoring
OEM Perf DB Home Top Activity
Performance Top Activity Copyright 2006
OEM SQL SQL Tune Session Top Activity • Schedule Advisor – Statistics – SQL Profile – Index – Restructure SQL – Miscellaneous • Implement Task
<< If developers don't have access to the same performance tools as DBAs then we are setting them up for failure >> @DBAKevlar
EM Express 12c Granted EM_EXPRESS_BASIC (read only) or EM_EXPRESS_ALL role.
Found SQL, now we get the Execution Plan Step 2: Get Explain Plan -------------------------------------------------------------------------------------------- | Id | Operation | Name | Starts | E-Rows | A-Rows | --------------------------------------------------------------------------------------------- | 1 | HASH GROUP BY | | 1 | 1 | 1 | |* 2 | FILTER | | 1 | | 1909 | |* 3 | TABLE ACCESS BY INDEX ROWID | PS_RETROPAYPGM_TBL | 1 | 1 | 3413 | | 4 | NESTED LOOPS | | 1 | 165 | 6827 | |* 5 | HASH JOIN | | 1 | 165 | 3413 | |* 6 | HASH JOIN | | 1 | 165 | 3624 | | 7 | TABLE ACCESS BY INDEX ROWID | WB_JOB | 1 | 242 | 2895 | | 8 | NESTED LOOPS | | 1 | 233 | 2897 | | 9 | TABLE ACCESS BY INDEX ROWID| PS_PAY_CALENDAR | 1 | 1 | 1 | |* 10 | INDEX RANGE SCAN | PS0PAY_CALENDAR | 1 | 1 | 1 | |* 11 | INDEX RANGE SCAN | WBBJOB_B | 1 | 286 | 2895 | |* 12 | TABLE ACCESS FULL | WB_RETROPAY_EARNS | 1 | 27456 | 122K| | 13 | TABLE ACCESS FULL | PS_RETROPAY_RQST | 1 | 13679 | 13679 | |* 14 | INDEX RANGE SCAN | PS#RETROPAYPGM_TBL | 3413 | 1 | 3413 | | 15 | SORT AGGREGATE | | 1791 | 1 | 1791 | | 16 | FIRST ROW | | 1791 | 1 | 1579 | |* 17 | INDEX RANGE SCAN (MIN/MAX) | WB_JOB_F | 1791 | 1 | 1579 | | 18 | SORT AGGREGATE | | 1539 | 1 | 1539 | | 19 | FIRST ROW | | 1539 | 1 | 1539 | |* 20 | INDEX RANGE SCAN (MIN/MAX) | WB_JOB_G | 1539 | 1 | 1539 | --------------------------------------------------------------------------------------------- Predicate Information (identified by operation id): --------------------------------------------------- 2 - filter(("B"."EFFDT"= AND "B"."EFFSEQ"=)) 3 - filter("E"."OFF_CYCLE"="A"."PAY_OFF_CYCLE_CAL") 5 - access("D"."RETROPAY_SEQ_NO"="C"."RETROPAY_SEQ_NO") 6 - access("C"."EMPLID"="B"."EMPLID" AND "C"."EMPL_RCD#"="B"."EMPL_RCD#") 10 - access("A"."RUN_ID"='PD2' AND "A"."PAY_CONFIRM_RUN"='N') 11 - access("B"."COMPANY"="A"."COMPANY" AND "B"."PAYGROUP"="A"."PAYGROUP") 12 - filter(("C"."RETROPAY_PRCS_FLAG"='C' AND "C"."RETROPAY_LOAD_SW"='Y')) 14 - access("E"."RETROPAY_PGM_ID"="D"."RETROPAY_PGM_ID") 17 - access("F"."EMPLID"=:B1 AND "F"."EMPL_RCD#"=:B2 AND "F"."EFFDT"<=:B3) 20 - access("G"."EMPLID"=:B1 AND "G"."EMPL_RCD#"=:B2 AND "G"."EFFDT"=:B3) PARSING IN CURSOR #2 len=53 dep=0 uid=61 oct=3 lid=61 tim=1151519905950403 hv=2296704914 ad='4e50010c' SELECT 'Hello, world; today is ' || SYSDATE FROM dual END OF STMT PARSE #2:c=4000,e=1540,p=0,cr=0,cu=0,mis=1,r=0,dep=0,og=1, tim=1151519905950397 BINDS #2: EXEC #2:c=0,e=58,p=0,cr=0,cu=0,mis=0,r=0,dep=0,og=1,tim=1 151519906034782 WAIT #2: nam='SQL*Net message to client' ela= 2 driver id=1650815232 #bytes=1 p3=0 obj#=-1 tim=1151519906034809 FETCH #2:c=0,e=29,p=0,cr=0,cu=0,mis=0,r=1,dep=0,og=1,tim=1 151519906034864 WAIT #2: nam='SQL*Net message from client' ela= 215 driver id=1650815232 #bytes=1 p3=0 obj#=-1 tim=1151519906035133 FETCH #2:c=0,e=1,p=0,cr=0,cu=0,mis=0,r=0,dep=0,og=0,tim=11 51519906035165 WAIT #2: nam='SQL*Net message to client' ela= 1 driver id=1650815232 #bytes=1 p3=0 obj#=-1 tim=1151519906035188 WAIT #2: nam='SQL*Net message from client' ela= 192 driver id=1650815232 #bytes=1 p3=0 obj#=-1 tim=1151519906035400 STAT #2 id=1 cnt=1 pid=0 pos=1 obj=0 op='FAST DUAL (cr=0 pr=0 pw=0 time=3 us) Trace fie
Step 3: ??? Methodology • Identify Slow Queries • Look at Execution Plan • Fix Fix 1. Analyze stats 2. Go to step 1 WTF?? Fix If you are lucky, analyze for 1. Column histograms 2. Missing or better Indexes
Explain Plan: Like Directions Where is the Map?
Explain Plan: Like Directions
Explain Plan: Like Directions
Two Table Joins – looks simple A B Inner Join Select * from A, B where A.field=B.field
SQL Joins
Two Table Joins A B A B A B A B A B Left join B B(+) Not exists B Right join B A(+) Not Exists A Inner Join A B A B Full outer (union) Union of Not Exists Blue = return White = found but Excluded Gray = Filtered out
A B Select * from A, B where A.field=B.field and A.field in (1,2) Inner Join
One to One - intersection 1 2 1 2 1 1 2 2 A B A B
One to Many - projection 1 1 2 2 1 2 1 1 1 1 2 2 2 2 B A
1 1 1 1 1 1 Many to Many - amplification 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 A B rA*rB ------------------------- min(ndv(A),ndv(B))
Mapping – One to One B A A B A B – One to Many – Many to Many
Join Direction 1 row 4 rows 8 rows 1 row 1 row 1 row order_lines orders customer
Three table join order_lines orders customer Select * From order_lines ol, orders o, customers c Where c.oid=o.id and o.olid=ol.id
Three table join order_lines orders customer F A Filter eliminates work start at filter Select * From order_lines ol, orders o, customers c Where c.oid=o.id and o.olid=ol.id and order_lines.field = value
Three table join order_lines orders customer F 1 2 Select * From order_lines ol, orders o, customers c Where c.oid=o.id and o.olid=ol.id and orders.field = value
Three table join order_lines orders customer F Select * From order_lines ol, orders o, customers c Where c.oid=o.id and o.olid=ol.id and customer.field = value
Three table join order_lines orders customer F F F Filter on all three? Choose best filter 100% * (select count(*) from TAB where condition) --------------------------- (select count(*) from Tab)
Best Filter 100% * (select count(*) from TAB where condition) --------------------------- (select count(*) from Tab) Rows Returned ------------------------- Rows in Table Filter Ratio =
4 or more table join Can only join ONE table at a time Can’t (normally) join branches
Put it all together : VST 1. Tables – drawn as nodes 2. Joins : – drawn map connector lines • One-to-one, one-to-many, many-to-many 3. Filters – mark on each table with filter in where clause 35 6/27/2013
How to VST: Tables and Joins SELECT C.Phone_Number, C.Honorific, C.First_Name, C.Last_Name, C.Suffix, C.Address_ID, A.Address_ID, A.Street_Address_Line1, A.Street_Address_Line2, A.City_Name, A.State_Abbreviation, A.ZIP_Code, OD.Deferred_Shipment_Date, OD.Item_Count, ODT.Text, OT.Text, P.Product_Description, S.Shipment_Date FROM Orders O, Order_Details OD, Products P, Customers C, Shipments S, Addresses A, Code_Translations ODT, Code_Translations OT WHERE UPPER(C.Last_Name) LIKE :Last_Name||'%' AND UPPER(C.First_Name) LIKE :First_Name||'%' AND OD.Order_ID = O.Order_ID AND O.Customer_ID = C.Customer_ID AND OD.Product_ID = P.Product_ID(+) AND OD.Shipment_ID = S.Shipment_ID(+) AND S.Address_ID = A.Address_ID(+) AND O.Status_Code = OT.Code AND OT.Code_Type = 'ORDER_STATUS' AND OD.Status_Code = ODT.Code AND ODT.Code_Type = 'ORDER_DETAIL_STATUS' AND O.Order_Date > :Now - 366 ORDER BY C.Customer_ID, O.Order_ID DESC, S.Shipment_ID, OD.Order_Detail_ID; Tables Orders O, Order_Details OD, Products P, Customers C, Shipments S, Addresses A, Code_Translations ODT, Code_Translations OT Joins OD.Order_ID = O.Order_ID O.Customer_ID = C.Customer_ID OD.Product_ID = P.Product_ID(+) OD.Shipment_ID = S.Shipment_ID(+) S.Address_ID = A.Address_ID(+) O.Status_Code = OT.Code OD.Status_Code = ODT.Code Dan Tow – SQL TUNING Filters WHERE UPPER(C.Last_Name) LIKE :Last_Name||'%' AND UPPER(C.First_Name) LIKE :First_Name||'%' AND OT.Code_Type = 'ORDER_STATUS' AND O.Order_Date > :Now – 366 AND ODT.Code_Type = 'ORDER_DETAIL_STATUS'
Layout tables and connections Tables Orders O, Order_Details OD, Products P, Customers C, Shipments S, Addresses A, Code_Translations ODT, Code_Translations OT Joins OD.Order_ID = O.Order_ID O.Customer_ID = C.Customer_ID OD.Product_ID = P.Product_ID(+) OD.Shipment_ID = S.Shipment_ID(+) S.Address_ID = A.Address_ID(+) O.Status_Code = OT.Code OD.Status_Code = ODT.Code F S A OD P ODT C OT O Dan Tow – SQL TUNING
Unstructured Copyright 2006 Joins OD.Order_ID = O.Order_ID O.Customer_ID = C.Customer_ID OD.Product_ID = P.Product_ID(+) OD.Shipment_ID = S.Shipment_ID(+) S.Address_ID = A.Address_ID(+) O.Status_Code = OT.Code OD.Status_Code = ODT.Code Neater, but can you do anything with it? What’s the optimal execution path? S A OD P ODT C OT O
Parents and Children Joins OD.Order_ID = O.Order_ID O.Customer_ID = C.Customer_ID OD.Product_ID = P.Product_ID(+) OD.Shipment_ID = S.Shipment_ID(+) S.Address_ID = A.Address_ID(+) O.Status_Code = OT.Code OD.Status_Code = ODT.Code ODT OD P C A O S OT Primary Key (unique index) No index or non-unique Master Detail Structure the tree
VST – filters and best path  Filters help determine best path Parent Child Parent Child Concept: 1. Start at most selective filter 2. Join down first, before joining upwards Filters WHERE UPPER(C.Last_Name) LIKE :Last_Name||'%' AND UPPER(C.First_Name) LIKE :First_Name||'%' AND OT.Code_Type = 'ORDER_STATUS‘ AND ODT.Code_Type = 'ORDER_DETAIL_STATUS' AND O.Order_Date > :Now – 366 F F 30% 0.02% 100% * (select count(*) from TAB where condition) --------------------------- (select count(*) from Tab) S A OD P ODT C OT O
F F 30% 0.02% S A OD P ODT C OT O VST – best path F F
F F 30% 0.02% S A OD P ODT C OT O VST – best path F F /*+ Leading (C,O,OT, OD ) */ Dan Tow SQL TUNING
T9 .6 T4 T1 .3 M T2 T6 T7 .001 T10 .5 T11 T12 .5 T13 .2 T3 T8 .7 T14 .9 T15 .8 T16 T5
T9 .6 T4 T1 .3 M T2 T6 T7 .001 T10 .5 T11 T12 .5 T13 .2 T3 T8 .7 T14 .9 T15 .8 T16 T5 T7 -> T13
T9 .6 T4 T1 .3 M T2 T6 T10 .5 T11 T12 .5 T3 T8 .7 T14 .9 T15 .8 T16 T5 T7 -> T13 T7 ->T13
T9 .6 T4 T1 .3 M T2 T6 T10 .5 T11 T3 T8 .7 T14 .9 T15 .8 T16 T5 T7 -> T13 T7 ->T13 -> T12
T9 .6 T4 T1 .3 M T6 T10 .5 T11 T3 T8 .7 T14 .9 T15 .8 T16 T5 T7 -> T13 T7 ->T13 -> T12 -> T2
T9 .6 T4 T1 .3 M T10 .5 T11 T3 T8 .7 T14 .9 T15 .8 T16 T5 T7 -> T13 T7, T13, T12 , T2 , T6
T9 .6 T4 T1 .3 M T11 T3 T8 .7 T14 .9 T15 .8 T16 T5 T7 -> T13 T7, T13, T12 , T2 , T6, T10
T9 .6 T4 T1 .3 M T3 T8 .7 T14 .9 T15 .8 T16 T5 T7 -> T13 T7, T13, T12 , T2 , T6, T10, T11
T9 .6 T4 T1 .3 M T3 T8 .7 T14 .9 T16 T5 T7 -> T13 T7, T13, T12 , T2 , T6, T10, T11, T15
T9 .6 T4 T1 .3 M T3 T8 .7 T14 .9 T5 T7 -> T13 T7, T13, T12 , T2 , T6, T10, T11, T15, T16
T9 .6 T4 T1 .3 T3 T8 .7 T14 .9 T5 T7 -> T13 T7, T13, T12 , T2 , T6, T10, T11, T15, T16, M
T9 .6 T4 T3 T8 .7 T14 .9 T5 T7 -> T13 T7, T13, T12 , T2 , T6, T10, T11, T15, T16, M, T1
T9 .6 T3 T8 .7 T14 .9 T5 T7 -> T13 T7, T13, T12 , T2 , T6, T10, T11, T15, T16, M, T1, T4
T3 T8 .7 T14 .9 T5 T7 -> T13 T7, T13, T12 , T2 , T6, T10, T1 1, T15, T16, M, T1, T4,T9
T5 T7 -> T13 T7, T13, T12 , T2 , T6, T10, T1 1, T15, T16, M, T1, T4,T9, T3,T8T14
T7, T13, T12 , T2 , T6, T10, T11, T15, T16, M, T1, T4,T9,T3,T8T 14, T5 Why not Guess ? For 17 table join, there are 355 Trillion combinations
Cartesian SELECT A.BROKER_ID BROKER_ID, A.BROKER_LAST_NAME BROKER_LAST_NAME, A.BROKER_FIRST_NAME BROKER_FIRST_NAME, A.YEARS_WITH_FIRM YEARS_WITH_FIRM, C.OFFICE_NAME OFFICE_NAME, SUM (B.BROKER_COMMISSION) TOTAL_COMMISSIONS FROM BROKER A, CLIENT_TRANSACTION B, OFFICE_LOCATION C, INVESTMENT I WHERE A.BROKER_ID = B.BROKER_ID AND A.OFFICE_LOCATION_ID = C.OFFICE_LOCATION_ID GROUP BY A.BROKER_ID, A.BROKER_LAST_NAME, A.BROKER_FIRST_NAME, A.YEARS_WITH_FIRM, C.OFFICE_NAME;
Implied Cartesian select c.client_first_name, c.client_last_name, ct.action, ct.price, b.broker_last_name, b.broker_first_name, o.office_name from client_transaction ct, client c, broker b, office_location o where ct.price > 100 and b.broker_id=ct.broker_id and c.broker_id = b.broker_id and o.office_location_id = b.office_location_id
Diagram work for Many to One What about many to many?
Unstructured Copyright 2006 Joins OD.Order_ID = O.Order_ID O.Customer_ID = C.Customer_ID OD.Product_ID = P.Product_ID(+) OD.Shipment_ID = S.Shipment_ID(+) S.Address_ID = A.Address_ID(+) O.Status_Code = OT.Code OD.Status_Code = ODT.Code S A OD P ODT C OT O S A OD P ODT C OT O
Many-to-One vs Many-to-Many Predicate Filter 1 2 3 B -> C -> A go to A or C? Now what?
Adding Constraints SELECT COUNT (*) FROM b, c, a WHERE b.val2 = 100 AND a.val1 = b.id AND b.val1 = c.id; 58 logical reads alter table c add constraint c_pk unique (id); alter table b add constraint b_pk unique (id); 7 logical reads
many to many ? • Where do we go? • How to improve? -> Add result sizes
Join sizes Join Sizes Pick Smallest result
Visual SQL Tuning (VST) Table Sizes Join Sizes Filter Ratios Exists
Execution Plan
Look at 3 queries • Query 1 runs more than 24 hours • Query 2 outer joins and scalar sub-queries • Query 3 create path not available to Oracle
Query 1 : Over 24 hours to run SELECT A0.zuchinis, A0.brocoli, C0.Oranges FROM ( SELECT A1.planted_date, A1.pears, A1.zuchinis, A1.brocoli FROM FOO.A A1, ( SELECT zuchinis, brocoli FROM FOO.A A2 WHERE pears = 'M' AND planted_date + 0 >= ADD_MONTHS ((SELECT MAX (planted_date) FROM FOO.B B1 WHERE pears = 'M' ), - 11) GROUP BY zuchinis, brocoli HAVING COUNT (*) = 12 ) i2 WHERE A1.planted_date = (SELECT MAX (planted_date) FROM FOO.B B2 WHERE pears = 'M' ) AND A1.pears = 'M' AND A1.zuchinis = i2.zuchinis (+) AND A1.brocoli = i2.brocoli (+) UNION SELECT A4.planted_date, A4.pears,A4.zuchinis,A4.brocoli FROM FOO.A A4 WHERE A4.planted_date >'01-OCT-08' and A4.planted_date <'03-OCT-08' AND A4.pears = 'D' AND A4.green_beans = '1' AND NOT EXISTS (SELECT * FROM FOO.A A5 WHERE pears = 'M' AND planted_date = (SELECT MAX (planted_date) FROM FOO.B B3 WHERE pears = 'M' ) AND A4.zuchinis = A5.zuchinis AND A4.brocoli = A5.brocoli) ) b, FOO.A A0, FOO.C C0, FOO.D D0, FOO.E E0 WHERE A0.planted_date >'01-OCT-08' and A0.planted_date <'03-OCT-08' AND A0.pears = 'D' AND A0.green_beans = '1' AND A0.zuchinis = b.zuchinis AND A0.brocoli = b.brocoli AND A0.planted_date = C0.planted_date AND A0.pears = C0.pears AND A0.zuchinis = C0.zuchinis AND A0.brocoli = C0.brocoli AND A0.planted_date = D0.planted_date AND A0.pears = D0.pears AND A0.harvest_size = D0.harvest_size AND C0.Oranges = D0.Oranges AND C0.apples = D0.apples AND (D0.lemons = 0 OR D0.lemons IS NULL) AND A0.planted_date = E0.planted_date AND A0.pears = E0.pears AND A0.harvest_size = E0.harvest_size AND C0.Oranges = E0.Oranges AND C0.apples = E0.apples AND (E0.lemons = 0 OR E0.lemons IS NULL) ORDER BY A0.zuchinis, A0.brocoli;
Visual SQL Diagram 9 secs
Default vs Tuned Default Tuned
Where is the map?
Comparing Plans : 24 hours to 5 mins NL NL NL NL HJ HJ NL NL
Q2 SELECT CASE WHEN M.NYC IS NULL THEN (SELECT /*+ qb_name(qb1) */ MAX (Kona) FROM foo.F WHERE harvest_date = to_date('08/10/2008','dd/mm/yyyy') AND Argentina = TRIM ('D') AND Norway = F_OUTER.Norway ELSE M.NYC END AS NYC, CASE WHEN F_OUTER.Perth IS NULL THEN NULL ELSE (SELECT /*+ qb_name(qb2) */ Georgia FROM foo.P WHERE harvest_date = to_date('08/10/2008','dd/mm/yyyy') AND Argentina = TRIM ('D') AND Paris = F_OUTER.Perth) END AS richard, CASE WHEN F_OUTER.Aruba IS NULL THEN NULL ELSE (SELECT /*+ qb_name(qb3) */ Georgia FROM foo.P WHERE harvest_date = to_date('08/10/2008','dd/mm/yyyy') AND Argentina = TRIM ('D') AND Paris = F_OUTER.Aruba) END AS Jody, CASE WHEN F_OUTER.Portland IS NULL THEN NULL ELSE (SELECT /*+ qb_name(qb4) */ Georgia FROM foo.P WHERE harvest_date = to_date('08/10/2008','dd/mm/yyyy') AND Argentina = TRIM ('D') AND Paris = F_OUTER.Portland) END AS Tom FROM foo.F F_OUTER, foo.M , foo.J , foo.N , (SELECT /*+ qb_name(qb5) */ H.SF, Oregon, H.Haiti, K.Bermuda, L.Denmark FROM (foo.H LEFT OUTER JOIN foo.K ON H.harvest_date = K.harvest_date AND H.Argentina = K.Argentina AND H.SF = K.SF AND K.Dallas = '001') LEFT OUTER JOIN FOo.L ON H.harvest_date = L.harvest_date AND H.Argentina = L.Argentina AND H.SF = L.SF WHERE H.harvest_date = to_date('08/10/2008','dd/mm/yyyy') AND H.Argentina = TRIM ('D')) extra WHERE F_OUTER.harvest_date = M.harvest_date(+) AND F_OUTER.Argentina = M.Argentina(+) AND F_OUTER.Norway = M.Norway(+) AND M.Norway(+) = M.Texas(+) AND F_OUTER.harvest_date = to_date('08/10/2008','dd/mm/yyyy') AND F_OUTER.Argentina = TRIM ('D') AND M.harvest_date(+) = to_date('08/10/2008','dd/mm/yyyy') AND M.Argentina(+) = TRIM ('D') AND F_OUTER.Norway = F_OUTER.Hawaii AND F_OUTER.harvest_date = J.harvest_date(+) AND F_OUTER.Argentina = J.Argentina(+) AND F_OUTER.Norway = J.Texas(+) AND J.harvest_date(+) = to_date('08/10/2008','dd/mm/yyyy') AND J.Argentina(+) = TRIM ('D') AND F_OUTER.Iraq = extra.SF(+) AND F_OUTER.harvest_date = N.harvest_date(+) AND F_OUTER.Argentina = N.Argentina(+) AND F_OUTER.Norway = N.Hawaii(+) AND N.Jordon(+) = '0' /
Scalar Sub-queries 12 825 845 682348
Q2 The subqueries in the select clause look like select CASE WHEN F.f1 IS NULL THEN NULL ELSE (SELECT X.f2 FROM X WHERE code_vl = F.f1) END AS f0 from F; and should be merged into the query like: select CASE WHEN F.f1 IS NULL THEN NULL ELSE ( X.f2) END AS f0 from F , X where code_vl(+) = F.f1; select CASE WHEN F.f1 IS NULL THEN NULL ELSE (SELECT X.f2 FROM X WHERE code_vl = F.f2) END AS f0 from F; select CASE WHEN F.f1 IS NULL THEN NULL ELSE ( X.f2) END AS f0 from F , X where code_vl(+) = F.f1;
Q3 SELECT DISTINCT * FROM FOO.a a, FOO.c c, FOO.d d, FOO.g g WHERE a.planted_date > '01-OCT-08' AND a.planted_date < '03-OCT-08' AND a.pears = 'D' AND a.green_beans = '1' AND a.planted_date = c.planted_date AND a.pears = c.pears AND a.zuchinis = c.zuchinis AND a.brocoli = c.brocoli AND a.planted_date = d.planted_date AND a.pears = d.pears AND a.harvest_size = d.harvest_size AND c.oranges = d.oranges AND c.apples = d.apples AND (d.lemons = 0 OR d.lemons IS NULL) AND a.planted_date = g.planted_date AND a.pears = g.pears AND a.harvest_size = g.harvest_size AND c.oranges = g.oranges AND c.apples = g.apples AND (g.lemons = 0 OR g.lemons IS NULL) AND a.zuchinis = '0236' AND d.apples = g.apples AND d.oranges = g.oranges ORDER BY a.zuchinis, a.brocoli;
Q3: Transitivity 80 6/27/2013 1,126,402 7,136,362
Q3 81 6/27/2013 SELECT * FROM ( SELECT /*+ NO_MERGE */ c.apples, c.oranges, a.harvest_size FROM a, c WHERE a.planted_date = TO_DATE ('02/10/2008', 'dd/mm/yyyy') AND a.pears = 'D' AND a.green_beans = '1' AND a.planted_date = c.planted_date AND a.pears = c.pears AND a.zuchinis = c.zuchinis AND a.brocoli = c.brocoli AND a.zuchinis = '0236' ) X, ( SELECT /*+ NO_MERGE */ d.apples, d.oranges, d.harvest_size FROM d, g WHERE d.planted_date = TO_DATE ('02/10/2008', 'dd/mm/yyyy') AND g.planted_date = TO_DATE ('02/10/2008', 'dd/mm/yyyy') AND g.apples = d.apples AND d.oranges = g.oranges AND d.pears = 'D' AND g.pears = 'D' AND g.pears = d.pears AND g.harvest_size = d.harvest_size AND (d.lemons = 0 OR d.lemons IS NULL) AND (g.lemons = 0 OR g.lemons IS NULL) ) Y WHERE X.oranges = Y.oranges AND X.apples = Y.apples AND X.harvest_size = Y.harvest_size; This final version runs in elapsed 0.33 secs and 12K logical reads down from an original elapsed 4.5 secs and 1M logical reads
HINTS First join order • LEADING (tab_alias , table_alias … ) 10g (9i use ORDERED, not as good ) • NO_MERGE Then choose join type • USE_NL (table_alias) – Inner Table probed into (2cd in xplan not driving) • USE_HASH (table_alias) – Inner hash result probe into (1st in xplan) • INDEX (tab_alias index_name) (examples http://www.adp-gmbh.ch/blog/2008/01/17.php) 82 6/27/2013
F F 30% 0.02% S A OD P ODT C OT O Leading Hint, use table alias (not table) F F /*+ Leading (C,O,OT, OD ) */
Y X LEADING(X,Y) USE_NL(Y) Nested Loops X and Y Select from X search in Y NL X Y
Y Hash results LEADING(Y, X ) USE_HASH(Y) X Hash Join X and Y Select from X search in Y Hash HJ Y X
What tools to use to create VST diagrams? • Paper – Modifications messy and difficult • PowerPoint – Can move things around – Sticky connectors – Easy to modify • DB Optimizer – Automatic and still modifiable
VST Steps Summary 1.Diagram tables 2.Draw connectors for each join 3.Calculate filter ratio 1.If many to many then calculate two table join sizes Execution Path • Start at the most selective join filter • Join to keep the running result set size small Many to Many relationships = problems 6/27/2013 Parent Child Parent Child F F 30% 0.02% S A OD P ODT C OT O
SELECT O.ORDER_ID, LINE_ITEM_ID, PRODUCT_ID, UNIT_PRICE, QUANTITY, ORDER_MODE, ORDER_STATUS, ORDER_TOTAL, SALES_REP_ID, PROMOTION_ID, C.CUSTOMER_ID, CUST_FIRST_NAME, CUST_LAST_NAME, CREDIT_LIMIT, CUST_EMAIL, ORDER_DATE FROM ORDERS O, ORDER_ITEMS OI, CUSTOMERS C WHERE O.ORDER_ID = OI.ORDER_ID AND O.CUSTOMER_ID = C.CUSTOMER_ID AND O.ORDER_STATUS <= 4 VST vs Explain Plan MJ F F
Graphical Explain Plan
Summary 1.Database - AAS – Profile database – Use wait interface and graphics – Identify machine, application, database or SQL 2.SQL - VST – Indexes, stats, execution path – Visual SQL Tuning
END
View Expansion
View Expansion
Types of Subqueries • subquery – query in where clause – Select 1 from dual where 1 = (select 1 from dual); • correlated subquery – Subquery uses fields from outer query – Select 1 from dual a where 1=(select 1 from dual b where a.dummy=b.dummy) • scalar subquery – Query in select list – Returns 1 value or null , ie scalar – Select (select 1 from dual) from dual; • inline views – Query in from clause – Select 1 from dual a, (select 1 from dual ) b;
Visual SQL Tuning
• Layout tables Graphically – Details tables above Masters – One to one relations side by side – Many to many any which way Many to single value
Join Set Sizes Join type max result set size possible notes one-to-scalar A this is equivalent to a filter on A table B returns one value like a max(), min(), count() etc one-to-one min(rA,rB) one-to-many rA Joining from A to B will not increase the result set size many-to-many rA*rB ------------------------- min(ndv(A),ndv(B)) The more duplicates in both tables the greater chance the result set size will explode 97 6/27/2013 We can say a lot about the join set size between two tables just by the join type and the number of rows in the table and NDV in the join column, but the easiest way most often is just to extract the two table joins and run a count(*) on that subset of the query
Join Filter ratios A B Jm=1 Jd ~> 1 FK PK A B Jm <= 1 Jd ~> 1 detail Master Unique index or unique constraint Jd, = join detail ratio , the avg number of rows returned when joining from the master to child Jm = master join ratio, the avg number of rows returned joining from the child into the master. Jm = 1 when PK/FK relations, Jm < 1 possible when unique indexes or unique constraints instead of PK/FK. Jd < 1 rare but acts as filter instead of a multiplier
Hash Join vs NL Col A Col B Col C Filter & Join Index Col D Table Y Table X Filter Index Join Index Col A Col B Col C Filter Index Join Index Col D Table Y Table X Filter Index Join Index NL HJ Driving Table (smaller set) Drive from Table Y off of set of rows returned from filter on column C Nested loops into Table X on Index on Join Filter results without Index even though index on filter column Create hash result set on Table Y from filter on column C Probe hash result set with rows from filter on table X on column A Filter Index Join Index Build Hash Table Probe Hash Table NL X Y HJ X Y
Left Deep HJ HJ HJ HJ T1 T2 T3 T4 T1 T2 T3 T4 HJ HJ HJ T1 T2 T3 Hashed Hashed probe probe T4 probe Hashed
Right Deep HJ HJ T4 HJ T3 HJ T2 T1 T2 T1 T3 T4 HJ HJ HJ T2 T1 T3 T4 probe hashed hashed hashed probe probe
Nest Loops left deep T1 T2 T3 T4 NL NL NL T1 T2 T3 T4 NL NL NL probed probed probed
Nest Loops can’t be right deep T3 T4 T2 T1 NL T1 NL T2 NL T3 T4 probed probed probed NL NL NL
Bushy T1 T2 HJ NL T1 T2 NL T3 T4 NL T3 T4 NL HJ select t3id, a.*, b.* from ( select /*+ no_merge */ t2.id t2id, t1.data t1data, t2.data t2data from t1, t2 where t1.id = t2.id ) a, ( select /*+ no_merge */ t3.id t3id, t3.data t3data, t4.data t4data from t3, t4 where t3.id = t4.id ) b where a.t2id=b.t3id /
Two Table Joins A B A B Left join B B(+) Right join B A(+) A B MAP MAP A B o o
Two Table Joins A B Left join B B(+) B returns no data, useless in Query Select a.* from a, b where b.field(+) = a.field; A B V A B V Multiplier o o ? Useless Pointless – join on B has no affect if no B cols selected V Pointless – join on B has no affect or multiplies rows from A if no B cols selected B B Multiplier, Useless?
Exists SELECT * FROM dept d WHERE exists ( SELECT null FROM emp e WHERE e.deptno=d.deptno); SELECT * FROM dept d WHERE d.deptno in ( SELECT deptno FROM emp e ); Select dept.* from emp, dept where emp.deptno= dept.deptno; /* can get duplicates */ dept emp E MAP
Not Exists SELECT * FROM dept d WHERE not exists ( SELECT null FROM emp e WHERE e.deptno=d.deptno); SELECT * FROM dept d WHERE d.deptno not in ( SELECT deptno FROM emp e and deptno is not null ); SELECT dept.* FROM dept LEFT OUTER JOIN emp ON dept.deptno = emp.deptno WHERE emp.deptno IS NULL; dept emp N MAP
Drawing Map – One to One / One to Many / Many to Many A B N A B o B A A B A B – Outer Joins / Not Exists

More Related Content

PPTX
SQL Tuning Methodology, Kscope 2013
byKyle Hailey
 
PPTX
SQL Tuning and VST
byKyle Hailey
 
PPTX
OOUG: VST , visual sql tuning diagrams
byKyle Hailey
 
PPTX
Oracle sql high performance tuning
byGuy Harrison
 
PPTX
DOAG: Visual SQL Tuning
byKyle Hailey
 
PPT
Oracle tips and tricks
byYanli Liu
 
PPTX
How to tune a query - ODTUG 2012
byConnor McDonald
 
ODP
BIS05 Introduction to SQL
byPrithwis Mukerjee
 
SQL Tuning Methodology, Kscope 2013
byKyle Hailey
 
SQL Tuning and VST
byKyle Hailey
 
OOUG: VST , visual sql tuning diagrams
byKyle Hailey
 
Oracle sql high performance tuning
byGuy Harrison
 
DOAG: Visual SQL Tuning
byKyle Hailey
 
Oracle tips and tricks
byYanli Liu
 
How to tune a query - ODTUG 2012
byConnor McDonald
 
BIS05 Introduction to SQL
byPrithwis Mukerjee
 

Similar to kscope2013vst-130627142814-phpapp02.pdf

PDF
Hailey_Database_Performance_Made_Easy_through_Graphics.pdf
bycookie1969
 
PPTX
Top 10 tips for Oracle performance
byGuy Harrison
 
PPTX
Optimizing queries MySQL
byGeorgi Sotirov
 
PPTX
Part1 of SQL Tuning Workshop - Understanding the Optimizer
byMaria Colgan
 
PDF
KScope19 - SQL Features
byConnor McDonald
 
PPT
Myth busters - performance tuning 101 2007
bypaulguerin
 
PPT
MS SQL Server.ppt sql
byNaheedBaloxh
 
TXT
Oracle sql tuning
bybishnupriya Panda
 
PPTX
SQL techniques for faster applications
byConnor McDonald
 
PDF
Very simple queries of DBMS
bymohit tripathi
 
PDF
UKOUG 2019 - SQL features
byConnor McDonald
 
PDF
Oracle Diagnostics : Joins - 1
byHemant K Chitale
 
PPTX
Sangam 18 - Great Applications with Great SQL
byConnor McDonald
 
PPTX
Sql and PL/SQL Best Practices I
byCarlos Oliveira
 
PPTX
Perth APAC Groundbreakers tour - SQL Techniques
byConnor McDonald
 
PPTX
Writing efficient sql
byj9soto
 
PDF
Find it. Fix it. Real-World SQL Tuning Cases with Karen Morton
byEmbarcadero Technologies
 
PPTX
Sql statements function join
bybaabtra.com - No. 1 supplier of quality freshers
 
PPTX
DOODB_LAB.pptx
byFilestreamFilestream
 
PDF
Transformations - how Oracle rewrites your statements
bySage Computing Services
 
Hailey_Database_Performance_Made_Easy_through_Graphics.pdf
bycookie1969
 
Top 10 tips for Oracle performance
byGuy Harrison
 
Optimizing queries MySQL
byGeorgi Sotirov
 
Part1 of SQL Tuning Workshop - Understanding the Optimizer
byMaria Colgan
 
KScope19 - SQL Features
byConnor McDonald
 
Myth busters - performance tuning 101 2007
bypaulguerin
 
MS SQL Server.ppt sql
byNaheedBaloxh
 
Oracle sql tuning
bybishnupriya Panda
 
SQL techniques for faster applications
byConnor McDonald
 
Very simple queries of DBMS
bymohit tripathi
 
UKOUG 2019 - SQL features
byConnor McDonald
 
Oracle Diagnostics : Joins - 1
byHemant K Chitale
 
Sangam 18 - Great Applications with Great SQL
byConnor McDonald
 
Sql and PL/SQL Best Practices I
byCarlos Oliveira
 
Perth APAC Groundbreakers tour - SQL Techniques
byConnor McDonald
 
Writing efficient sql
byj9soto
 
Find it. Fix it. Real-World SQL Tuning Cases with Karen Morton
byEmbarcadero Technologies
 
Sql statements function join
bybaabtra.com - No. 1 supplier of quality freshers
 
DOODB_LAB.pptx
byFilestreamFilestream
 
Transformations - how Oracle rewrites your statements
bySage Computing Services
 

More from TricantinoLopezPerez

PDF
31063115_1679409488310Developer_Tuning_Tips_-_UTOUG_Mar_2023.pdf
byTricantinoLopezPerez
 
PDF
2020-TipsAndTrickssssasdfasdfasdfasdfasdf.pdf
byTricantinoLopezPerez
 
PPT
Oracle Wait Events That Everyone Should Know.ppt
byTricantinoLopezPerez
 
PDF
ash-1-130820122404-phpapp01.pdf
byTricantinoLopezPerez
 
PDF
TGorman Collab16 UnixTools 20160411.pdf
byTricantinoLopezPerez
 
PDF
exadata-database-machine-kpis-3224944.pdf
byTricantinoLopezPerez
 
PDF
pdfslide.net_em12c-capacity-planning-with-oem-metrics_2.pdf
byTricantinoLopezPerez
 
PDF
linux-memory-explained.pdf
byTricantinoLopezPerez
 
PDF
33-ORAWORLDasdfasdfas asdfasdfasdfa asd.pdf
byTricantinoLopezPerez
 
PPT
sqltuningcardinality1(1).ppt
byTricantinoLopezPerez
 
PPT
BrownbagIntrotosqltuning.ppt
byTricantinoLopezPerez
 
PDF
sqltuning101-170419021007-2.pdf
byTricantinoLopezPerez
 
DOC
TA110_System_Capacity_Plan.doc
byTricantinoLopezPerez
 
PDF
con9578-2088758.pdf
byTricantinoLopezPerez
 
31063115_1679409488310Developer_Tuning_Tips_-_UTOUG_Mar_2023.pdf
byTricantinoLopezPerez
 
2020-TipsAndTrickssssasdfasdfasdfasdfasdf.pdf
byTricantinoLopezPerez
 
Oracle Wait Events That Everyone Should Know.ppt
byTricantinoLopezPerez
 
ash-1-130820122404-phpapp01.pdf
byTricantinoLopezPerez
 
TGorman Collab16 UnixTools 20160411.pdf
byTricantinoLopezPerez
 
exadata-database-machine-kpis-3224944.pdf
byTricantinoLopezPerez
 
pdfslide.net_em12c-capacity-planning-with-oem-metrics_2.pdf
byTricantinoLopezPerez
 
linux-memory-explained.pdf
byTricantinoLopezPerez
 
33-ORAWORLDasdfasdfas asdfasdfasdfa asd.pdf
byTricantinoLopezPerez
 
sqltuningcardinality1(1).ppt
byTricantinoLopezPerez
 
BrownbagIntrotosqltuning.ppt
byTricantinoLopezPerez
 
sqltuning101-170419021007-2.pdf
byTricantinoLopezPerez
 
TA110_System_Capacity_Plan.doc
byTricantinoLopezPerez
 
con9578-2088758.pdf
byTricantinoLopezPerez
 

Recently uploaded

PDF
Volvo Ec210c L Ec210cl Brake Service Manual.pdf
byabjekGoogle
 
PDF
750C John Deere Crawler Dozer Diagnostic TM1588.pdf
byabjekGoogle
 
PPT
dvasdvdvascacava a sd sdc rg sves df vasdv
bykoundinyakumarb
 
PDF
John Deere Gator Utility Vehicles XUV865E XUV865M XUV865R Technical Manual TM...
byabjekGoogle
 
PDF
XUV865R John Deere Gator Utility Vehicles Technical Manual
byabjekGoogle
 
PDF
Việc Làm 24h_Việc Làm 24h - Report - 1_21_11_2025_4104.pdf
byjaydeeiiiiiii
 
PDF
Volvo Ec150lc Ec150 Lc Technical Service Repair Manual.pdf
byabjekGoogle
 
PPTX
Flex Fuel Technology in Automotive Industry
byanandaprakashswain
 
PDF
Toyota Urban Cruiser Taisor on road price
byGalaxy Toyota
 
PDF
Volvo Ec330b Excavators Service Manual.pdf
byabjekGoogle
 
PDF
1= https___10-0-0-1.ph_.10.0.0.1, 10.0.0
bypisowifirouter10001
 
PDF
Tm1228 John Deere 544C Service Repair Manual.pdf
byabjekGoogle
 
PDF
Volvo Ec460b Excavators Service Manual.pdf
byabjekGoogle
 
PDF
anishvcrsurgicalurinarycase-191015103645.pdf
byakkubakku1234vinay
 
PPT
LEA-212-Final-coverage.ppt na dapat i review kapag
byangelomark2415
 
PPTX
allergen immunotherapy - presented by prakash katikerajula 2.pptx
bykatikerajulaprakash
 
PPTX
DNA replication 4.1.pptxfgfhgvghgjdsgfcvcvbhg
bygowrichandran9
 
PPTX
AI-Based-Attendance-and-HRMS-Future-in-India-2026 (2).pptx
byFlipark HRMS
 
PPTX
Phd topical fluoride preparation present
byalanpspnala12
 
PPTX
Disaster managment complet ppt.pertyuioiuyt
byinfinitymeta343
 
Volvo Ec210c L Ec210cl Brake Service Manual.pdf
byabjekGoogle
 
750C John Deere Crawler Dozer Diagnostic TM1588.pdf
byabjekGoogle
 
dvasdvdvascacava a sd sdc rg sves df vasdv
bykoundinyakumarb
 
John Deere Gator Utility Vehicles XUV865E XUV865M XUV865R Technical Manual TM...
byabjekGoogle
 
XUV865R John Deere Gator Utility Vehicles Technical Manual
byabjekGoogle
 
Việc Làm 24h_Việc Làm 24h - Report - 1_21_11_2025_4104.pdf
byjaydeeiiiiiii
 
Volvo Ec150lc Ec150 Lc Technical Service Repair Manual.pdf
byabjekGoogle
 
Flex Fuel Technology in Automotive Industry
byanandaprakashswain
 
Toyota Urban Cruiser Taisor on road price
byGalaxy Toyota
 
Volvo Ec330b Excavators Service Manual.pdf
byabjekGoogle
 
1= https___10-0-0-1.ph_.10.0.0.1, 10.0.0
bypisowifirouter10001
 
Tm1228 John Deere 544C Service Repair Manual.pdf
byabjekGoogle
 
Volvo Ec460b Excavators Service Manual.pdf
byabjekGoogle
 
anishvcrsurgicalurinarycase-191015103645.pdf
byakkubakku1234vinay
 
LEA-212-Final-coverage.ppt na dapat i review kapag
byangelomark2415
 
allergen immunotherapy - presented by prakash katikerajula 2.pptx
bykatikerajulaprakash
 
DNA replication 4.1.pptxfgfhgvghgjdsgfcvcvbhg
bygowrichandran9
 
AI-Based-Attendance-and-HRMS-Future-in-India-2026 (2).pptx
byFlipark HRMS
 
Phd topical fluoride preparation present
byalanpspnala12
 
Disaster managment complet ppt.pertyuioiuyt
byinfinitymeta343
 

kscope2013vst-130627142814-phpapp02.pdf

  • 1.
    Visual SQL Tuning(VST) Kyle Hailey Kscope 2013 New Orleans kylelf@gmail.com http://dboptimizer.com
  • 2.
    Who is KyleHailey  1990 Oracle – 90 support – 92 Ported v6 – 93 France – 95 Benchmarking – 98 ST Real World Performance  2000 Dot.Com  2001 Quest  2002 Oracle OEM 10g Success! First successful OEM design
  • 3.
    Who is KyleHailey  1990 Oracle – 90 support – 92 Ported v6 – 93 France – 95 Benchmarking – 98 ST Real World Performance  2000 Dot.Com  2001 Quest a  2002 Oracle OEM 10g  2005 Embarcadero – DB Optimizer
  • 4.
    Who is KyleHailey • 1990 Oracle  90 support  92 Ported v6  93 France  95 Benchmarking  98 ST Real World Performance • 2000 Dot.Com • 2001 Quest • 2002 Oracle OEM 10g • 2005 Embarcadero  DB Optimizer • 2010 Delphix When not being a Geek - Have a little 4 year old boy who takes up all my time
  • 5.
    Typical Architecture Database File system Production Instance Database Filesystem Development Instance Database File system QA Instance Database UAT Instance File system
  • 6.
    Clones share duplicateblocks Development Instance Database Instance File system Database QA Instance UAT Instance Database Database Source Database Virtual Databases
  • 7.
    SQL Tuning Methodology 1. Find:Problem SQL 2. Study: SQL Execution Plan 3. Fix: How ?
  • 8.
    Step 1 :Find “bad” SQL 1. Users complain 2. High Resources 3. Monitoring
  • 9.
  • 10.
  • 11.
    OEM SQL SQL Tune Session Top Activity • ScheduleAdvisor – Statistics – SQL Profile – Index – Restructure SQL – Miscellaneous • Implement Task
  • 12.
    << If developers don'thave access to the same performance tools as DBAs then we are setting them up for failure >> @DBAKevlar
  • 13.
    EM Express 12c GrantedEM_EXPRESS_BASIC (read only) or EM_EXPRESS_ALL role.
  • 14.
    Found SQL, nowwe get the Execution Plan Step 2: Get Explain Plan -------------------------------------------------------------------------------------------- | Id | Operation | Name | Starts | E-Rows | A-Rows | --------------------------------------------------------------------------------------------- | 1 | HASH GROUP BY | | 1 | 1 | 1 | |* 2 | FILTER | | 1 | | 1909 | |* 3 | TABLE ACCESS BY INDEX ROWID | PS_RETROPAYPGM_TBL | 1 | 1 | 3413 | | 4 | NESTED LOOPS | | 1 | 165 | 6827 | |* 5 | HASH JOIN | | 1 | 165 | 3413 | |* 6 | HASH JOIN | | 1 | 165 | 3624 | | 7 | TABLE ACCESS BY INDEX ROWID | WB_JOB | 1 | 242 | 2895 | | 8 | NESTED LOOPS | | 1 | 233 | 2897 | | 9 | TABLE ACCESS BY INDEX ROWID| PS_PAY_CALENDAR | 1 | 1 | 1 | |* 10 | INDEX RANGE SCAN | PS0PAY_CALENDAR | 1 | 1 | 1 | |* 11 | INDEX RANGE SCAN | WBBJOB_B | 1 | 286 | 2895 | |* 12 | TABLE ACCESS FULL | WB_RETROPAY_EARNS | 1 | 27456 | 122K| | 13 | TABLE ACCESS FULL | PS_RETROPAY_RQST | 1 | 13679 | 13679 | |* 14 | INDEX RANGE SCAN | PS#RETROPAYPGM_TBL | 3413 | 1 | 3413 | | 15 | SORT AGGREGATE | | 1791 | 1 | 1791 | | 16 | FIRST ROW | | 1791 | 1 | 1579 | |* 17 | INDEX RANGE SCAN (MIN/MAX) | WB_JOB_F | 1791 | 1 | 1579 | | 18 | SORT AGGREGATE | | 1539 | 1 | 1539 | | 19 | FIRST ROW | | 1539 | 1 | 1539 | |* 20 | INDEX RANGE SCAN (MIN/MAX) | WB_JOB_G | 1539 | 1 | 1539 | --------------------------------------------------------------------------------------------- Predicate Information (identified by operation id): --------------------------------------------------- 2 - filter(("B"."EFFDT"= AND "B"."EFFSEQ"=)) 3 - filter("E"."OFF_CYCLE"="A"."PAY_OFF_CYCLE_CAL") 5 - access("D"."RETROPAY_SEQ_NO"="C"."RETROPAY_SEQ_NO") 6 - access("C"."EMPLID"="B"."EMPLID" AND "C"."EMPL_RCD#"="B"."EMPL_RCD#") 10 - access("A"."RUN_ID"='PD2' AND "A"."PAY_CONFIRM_RUN"='N') 11 - access("B"."COMPANY"="A"."COMPANY" AND "B"."PAYGROUP"="A"."PAYGROUP") 12 - filter(("C"."RETROPAY_PRCS_FLAG"='C' AND "C"."RETROPAY_LOAD_SW"='Y')) 14 - access("E"."RETROPAY_PGM_ID"="D"."RETROPAY_PGM_ID") 17 - access("F"."EMPLID"=:B1 AND "F"."EMPL_RCD#"=:B2 AND "F"."EFFDT"<=:B3) 20 - access("G"."EMPLID"=:B1 AND "G"."EMPL_RCD#"=:B2 AND "G"."EFFDT"=:B3) PARSING IN CURSOR #2 len=53 dep=0 uid=61 oct=3 lid=61 tim=1151519905950403 hv=2296704914 ad='4e50010c' SELECT 'Hello, world; today is ' || SYSDATE FROM dual END OF STMT PARSE #2:c=4000,e=1540,p=0,cr=0,cu=0,mis=1,r=0,dep=0,og=1, tim=1151519905950397 BINDS #2: EXEC #2:c=0,e=58,p=0,cr=0,cu=0,mis=0,r=0,dep=0,og=1,tim=1 151519906034782 WAIT #2: nam='SQL*Net message to client' ela= 2 driver id=1650815232 #bytes=1 p3=0 obj#=-1 tim=1151519906034809 FETCH #2:c=0,e=29,p=0,cr=0,cu=0,mis=0,r=1,dep=0,og=1,tim=1 151519906034864 WAIT #2: nam='SQL*Net message from client' ela= 215 driver id=1650815232 #bytes=1 p3=0 obj#=-1 tim=1151519906035133 FETCH #2:c=0,e=1,p=0,cr=0,cu=0,mis=0,r=0,dep=0,og=0,tim=11 51519906035165 WAIT #2: nam='SQL*Net message to client' ela= 1 driver id=1650815232 #bytes=1 p3=0 obj#=-1 tim=1151519906035188 WAIT #2: nam='SQL*Net message from client' ela= 192 driver id=1650815232 #bytes=1 p3=0 obj#=-1 tim=1151519906035400 STAT #2 id=1 cnt=1 pid=0 pos=1 obj=0 op='FAST DUAL (cr=0 pr=0 pw=0 time=3 us) Trace fie
  • 15.
    Step 3: ??? Methodology •Identify Slow Queries • Look at Execution Plan • Fix Fix 1. Analyze stats 2. Go to step 1 WTF?? Fix If you are lucky, analyze for 1. Column histograms 2. Missing or better Indexes
  • 16.
    Explain Plan: LikeDirections Where is the Map?
  • 17.
  • 18.
  • 19.
    Two Table Joins– looks simple A B Inner Join Select * from A, B where A.field=B.field
  • 20.
  • 21.
    Two Table Joins AB A B A B A B A B Left join B B(+) Not exists B Right join B A(+) Not Exists A Inner Join A B A B Full outer (union) Union of Not Exists Blue = return White = found but Excluded Gray = Filtered out
  • 22.
    A B Select * from A,B where A.field=B.field and A.field in (1,2) Inner Join
  • 23.
    One to One- intersection 1 2 1 2 1 1 2 2 A B A B
  • 24.
    One to Many- projection 1 1 2 2 1 2 1 1 1 1 2 2 2 2 B A
  • 25.
    1 1 1 1 1 1 Many to Many- amplification 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 A B rA*rB ------------------------- min(ndv(A),ndv(B))
  • 26.
    Mapping – One toOne B A A B A B – One to Many – Many to Many
  • 27.
    Join Direction 1 row 4rows 8 rows 1 row 1 row 1 row order_lines orders customer
  • 28.
    Three table join order_linesorders customer Select * From order_lines ol, orders o, customers c Where c.oid=o.id and o.olid=ol.id
  • 29.
    Three table join order_linesorders customer F A Filter eliminates work start at filter Select * From order_lines ol, orders o, customers c Where c.oid=o.id and o.olid=ol.id and order_lines.field = value
  • 30.
    Three table join order_linesorders customer F 1 2 Select * From order_lines ol, orders o, customers c Where c.oid=o.id and o.olid=ol.id and orders.field = value
  • 31.
    Three table join order_linesorders customer F Select * From order_lines ol, orders o, customers c Where c.oid=o.id and o.olid=ol.id and customer.field = value
  • 32.
    Three table join order_linesorders customer F F F Filter on all three? Choose best filter 100% * (select count(*) from TAB where condition) --------------------------- (select count(*) from Tab)
  • 33.
    Best Filter 100% *(select count(*) from TAB where condition) --------------------------- (select count(*) from Tab) Rows Returned ------------------------- Rows in Table Filter Ratio =
  • 34.
    4 or moretable join Can only join ONE table at a time Can’t (normally) join branches
  • 35.
    Put it alltogether : VST 1. Tables – drawn as nodes 2. Joins : – drawn map connector lines • One-to-one, one-to-many, many-to-many 3. Filters – mark on each table with filter in where clause 35 6/27/2013
  • 36.
    How to VST:Tables and Joins SELECT C.Phone_Number, C.Honorific, C.First_Name, C.Last_Name, C.Suffix, C.Address_ID, A.Address_ID, A.Street_Address_Line1, A.Street_Address_Line2, A.City_Name, A.State_Abbreviation, A.ZIP_Code, OD.Deferred_Shipment_Date, OD.Item_Count, ODT.Text, OT.Text, P.Product_Description, S.Shipment_Date FROM Orders O, Order_Details OD, Products P, Customers C, Shipments S, Addresses A, Code_Translations ODT, Code_Translations OT WHERE UPPER(C.Last_Name) LIKE :Last_Name||'%' AND UPPER(C.First_Name) LIKE :First_Name||'%' AND OD.Order_ID = O.Order_ID AND O.Customer_ID = C.Customer_ID AND OD.Product_ID = P.Product_ID(+) AND OD.Shipment_ID = S.Shipment_ID(+) AND S.Address_ID = A.Address_ID(+) AND O.Status_Code = OT.Code AND OT.Code_Type = 'ORDER_STATUS' AND OD.Status_Code = ODT.Code AND ODT.Code_Type = 'ORDER_DETAIL_STATUS' AND O.Order_Date > :Now - 366 ORDER BY C.Customer_ID, O.Order_ID DESC, S.Shipment_ID, OD.Order_Detail_ID; Tables Orders O, Order_Details OD, Products P, Customers C, Shipments S, Addresses A, Code_Translations ODT, Code_Translations OT Joins OD.Order_ID = O.Order_ID O.Customer_ID = C.Customer_ID OD.Product_ID = P.Product_ID(+) OD.Shipment_ID = S.Shipment_ID(+) S.Address_ID = A.Address_ID(+) O.Status_Code = OT.Code OD.Status_Code = ODT.Code Dan Tow – SQL TUNING Filters WHERE UPPER(C.Last_Name) LIKE :Last_Name||'%' AND UPPER(C.First_Name) LIKE :First_Name||'%' AND OT.Code_Type = 'ORDER_STATUS' AND O.Order_Date > :Now – 366 AND ODT.Code_Type = 'ORDER_DETAIL_STATUS'
  • 37.
    Layout tables andconnections Tables Orders O, Order_Details OD, Products P, Customers C, Shipments S, Addresses A, Code_Translations ODT, Code_Translations OT Joins OD.Order_ID = O.Order_ID O.Customer_ID = C.Customer_ID OD.Product_ID = P.Product_ID(+) OD.Shipment_ID = S.Shipment_ID(+) S.Address_ID = A.Address_ID(+) O.Status_Code = OT.Code OD.Status_Code = ODT.Code F S A OD P ODT C OT O Dan Tow – SQL TUNING
  • 38.
    Unstructured Copyright 2006 Joins OD.Order_ID =O.Order_ID O.Customer_ID = C.Customer_ID OD.Product_ID = P.Product_ID(+) OD.Shipment_ID = S.Shipment_ID(+) S.Address_ID = A.Address_ID(+) O.Status_Code = OT.Code OD.Status_Code = ODT.Code Neater, but can you do anything with it? What’s the optimal execution path? S A OD P ODT C OT O
  • 39.
    Parents and Children Joins OD.Order_ID= O.Order_ID O.Customer_ID = C.Customer_ID OD.Product_ID = P.Product_ID(+) OD.Shipment_ID = S.Shipment_ID(+) S.Address_ID = A.Address_ID(+) O.Status_Code = OT.Code OD.Status_Code = ODT.Code ODT OD P C A O S OT Primary Key (unique index) No index or non-unique Master Detail Structure the tree
  • 40.
    VST – filtersand best path  Filters help determine best path Parent Child Parent Child Concept: 1. Start at most selective filter 2. Join down first, before joining upwards Filters WHERE UPPER(C.Last_Name) LIKE :Last_Name||'%' AND UPPER(C.First_Name) LIKE :First_Name||'%' AND OT.Code_Type = 'ORDER_STATUS‘ AND ODT.Code_Type = 'ORDER_DETAIL_STATUS' AND O.Order_Date > :Now – 366 F F 30% 0.02% 100% * (select count(*) from TAB where condition) --------------------------- (select count(*) from Tab) S A OD P ODT C OT O
  • 41.
  • 42.
    F F 30% 0.02% S A OD P ODT C OT O VST– best path F F /*+ Leading (C,O,OT, OD ) */ Dan Tow SQL TUNING
  • 44.
  • 45.
  • 46.
  • 47.
  • 48.
  • 49.
  • 50.
  • 51.
  • 52.
  • 53.
    T9 .6 T4 T1 .3 M T3 T8 .7 T14 .9 T5 T7 -> T13 T7,T13, T12 , T2 , T6, T10, T11, T15, T16
  • 54.
    T9 .6 T4 T1 .3 T3 T8 .7 T14 .9 T5 T7 -> T13 T7,T13, T12 , T2 , T6, T10, T11, T15, T16, M
  • 55.
    T9 .6 T4 T3 T8 .7 T14 .9 T5 T7 -> T13 T7,T13, T12 , T2 , T6, T10, T11, T15, T16, M, T1
  • 56.
    T9 .6 T3 T8 .7 T14 .9 T5 T7 -> T13 T7,T13, T12 , T2 , T6, T10, T11, T15, T16, M, T1, T4
  • 57.
    T3 T8 .7 T14 .9 T5 T7 -> T13 T7,T13, T12 , T2 , T6, T10, T1 1, T15, T16, M, T1, T4,T9
  • 58.
    T5 T7 -> T13 T7,T13, T12 , T2 , T6, T10, T1 1, T15, T16, M, T1, T4,T9, T3,T8T14
  • 59.
    T7, T13, T12 ,T2 , T6, T10, T11, T15, T16, M, T1, T4,T9,T3,T8T 14, T5 Why not Guess ? For 17 table join, there are 355 Trillion combinations
  • 60.
    Cartesian SELECT A.BROKER_ID BROKER_ID, A.BROKER_LAST_NAME BROKER_LAST_NAME, A.BROKER_FIRST_NAMEBROKER_FIRST_NAME, A.YEARS_WITH_FIRM YEARS_WITH_FIRM, C.OFFICE_NAME OFFICE_NAME, SUM (B.BROKER_COMMISSION) TOTAL_COMMISSIONS FROM BROKER A, CLIENT_TRANSACTION B, OFFICE_LOCATION C, INVESTMENT I WHERE A.BROKER_ID = B.BROKER_ID AND A.OFFICE_LOCATION_ID = C.OFFICE_LOCATION_ID GROUP BY A.BROKER_ID, A.BROKER_LAST_NAME, A.BROKER_FIRST_NAME, A.YEARS_WITH_FIRM, C.OFFICE_NAME;
  • 61.
    Implied Cartesian select c.client_first_name, c.client_last_name, ct.action,ct.price, b.broker_last_name, b.broker_first_name, o.office_name from client_transaction ct, client c, broker b, office_location o where ct.price > 100 and b.broker_id=ct.broker_id and c.broker_id = b.broker_id and o.office_location_id = b.office_location_id
  • 62.
    Diagram work forMany to One What about many to many?
  • 63.
    Unstructured Copyright 2006 Joins OD.Order_ID =O.Order_ID O.Customer_ID = C.Customer_ID OD.Product_ID = P.Product_ID(+) OD.Shipment_ID = S.Shipment_ID(+) S.Address_ID = A.Address_ID(+) O.Status_Code = OT.Code OD.Status_Code = ODT.Code S A OD P ODT C OT O S A OD P ODT C OT O
  • 64.
    Many-to-One vs Many-to-Many PredicateFilter 1 2 3 B -> C -> A go to A or C? Now what?
  • 65.
    Adding Constraints SELECT COUNT(*) FROM b, c, a WHERE b.val2 = 100 AND a.val1 = b.id AND b.val1 = c.id; 58 logical reads alter table c add constraint c_pk unique (id); alter table b add constraint b_pk unique (id); 7 logical reads
  • 66.
    many to many? • Where do we go? • How to improve? -> Add result sizes
  • 67.
  • 68.
    Visual SQL Tuning(VST) Table Sizes Join Sizes Filter Ratios Exists
  • 69.
  • 70.
    Look at 3queries • Query 1 runs more than 24 hours • Query 2 outer joins and scalar sub-queries • Query 3 create path not available to Oracle
  • 71.
    Query 1 :Over 24 hours to run SELECT A0.zuchinis, A0.brocoli, C0.Oranges FROM ( SELECT A1.planted_date, A1.pears, A1.zuchinis, A1.brocoli FROM FOO.A A1, ( SELECT zuchinis, brocoli FROM FOO.A A2 WHERE pears = 'M' AND planted_date + 0 >= ADD_MONTHS ((SELECT MAX (planted_date) FROM FOO.B B1 WHERE pears = 'M' ), - 11) GROUP BY zuchinis, brocoli HAVING COUNT (*) = 12 ) i2 WHERE A1.planted_date = (SELECT MAX (planted_date) FROM FOO.B B2 WHERE pears = 'M' ) AND A1.pears = 'M' AND A1.zuchinis = i2.zuchinis (+) AND A1.brocoli = i2.brocoli (+) UNION SELECT A4.planted_date, A4.pears,A4.zuchinis,A4.brocoli FROM FOO.A A4 WHERE A4.planted_date >'01-OCT-08' and A4.planted_date <'03-OCT-08' AND A4.pears = 'D' AND A4.green_beans = '1' AND NOT EXISTS (SELECT * FROM FOO.A A5 WHERE pears = 'M' AND planted_date = (SELECT MAX (planted_date) FROM FOO.B B3 WHERE pears = 'M' ) AND A4.zuchinis = A5.zuchinis AND A4.brocoli = A5.brocoli) ) b, FOO.A A0, FOO.C C0, FOO.D D0, FOO.E E0 WHERE A0.planted_date >'01-OCT-08' and A0.planted_date <'03-OCT-08' AND A0.pears = 'D' AND A0.green_beans = '1' AND A0.zuchinis = b.zuchinis AND A0.brocoli = b.brocoli AND A0.planted_date = C0.planted_date AND A0.pears = C0.pears AND A0.zuchinis = C0.zuchinis AND A0.brocoli = C0.brocoli AND A0.planted_date = D0.planted_date AND A0.pears = D0.pears AND A0.harvest_size = D0.harvest_size AND C0.Oranges = D0.Oranges AND C0.apples = D0.apples AND (D0.lemons = 0 OR D0.lemons IS NULL) AND A0.planted_date = E0.planted_date AND A0.pears = E0.pears AND A0.harvest_size = E0.harvest_size AND C0.Oranges = E0.Oranges AND C0.apples = E0.apples AND (E0.lemons = 0 OR E0.lemons IS NULL) ORDER BY A0.zuchinis, A0.brocoli;
  • 72.
  • 73.
  • 74.
  • 75.
    Comparing Plans :24 hours to 5 mins NL NL NL NL HJ HJ NL NL
  • 76.
    Q2 SELECT CASE WHENM.NYC IS NULL THEN (SELECT /*+ qb_name(qb1) */ MAX (Kona) FROM foo.F WHERE harvest_date = to_date('08/10/2008','dd/mm/yyyy') AND Argentina = TRIM ('D') AND Norway = F_OUTER.Norway ELSE M.NYC END AS NYC, CASE WHEN F_OUTER.Perth IS NULL THEN NULL ELSE (SELECT /*+ qb_name(qb2) */ Georgia FROM foo.P WHERE harvest_date = to_date('08/10/2008','dd/mm/yyyy') AND Argentina = TRIM ('D') AND Paris = F_OUTER.Perth) END AS richard, CASE WHEN F_OUTER.Aruba IS NULL THEN NULL ELSE (SELECT /*+ qb_name(qb3) */ Georgia FROM foo.P WHERE harvest_date = to_date('08/10/2008','dd/mm/yyyy') AND Argentina = TRIM ('D') AND Paris = F_OUTER.Aruba) END AS Jody, CASE WHEN F_OUTER.Portland IS NULL THEN NULL ELSE (SELECT /*+ qb_name(qb4) */ Georgia FROM foo.P WHERE harvest_date = to_date('08/10/2008','dd/mm/yyyy') AND Argentina = TRIM ('D') AND Paris = F_OUTER.Portland) END AS Tom FROM foo.F F_OUTER, foo.M , foo.J , foo.N , (SELECT /*+ qb_name(qb5) */ H.SF, Oregon, H.Haiti, K.Bermuda, L.Denmark FROM (foo.H LEFT OUTER JOIN foo.K ON H.harvest_date = K.harvest_date AND H.Argentina = K.Argentina AND H.SF = K.SF AND K.Dallas = '001') LEFT OUTER JOIN FOo.L ON H.harvest_date = L.harvest_date AND H.Argentina = L.Argentina AND H.SF = L.SF WHERE H.harvest_date = to_date('08/10/2008','dd/mm/yyyy') AND H.Argentina = TRIM ('D')) extra WHERE F_OUTER.harvest_date = M.harvest_date(+) AND F_OUTER.Argentina = M.Argentina(+) AND F_OUTER.Norway = M.Norway(+) AND M.Norway(+) = M.Texas(+) AND F_OUTER.harvest_date = to_date('08/10/2008','dd/mm/yyyy') AND F_OUTER.Argentina = TRIM ('D') AND M.harvest_date(+) = to_date('08/10/2008','dd/mm/yyyy') AND M.Argentina(+) = TRIM ('D') AND F_OUTER.Norway = F_OUTER.Hawaii AND F_OUTER.harvest_date = J.harvest_date(+) AND F_OUTER.Argentina = J.Argentina(+) AND F_OUTER.Norway = J.Texas(+) AND J.harvest_date(+) = to_date('08/10/2008','dd/mm/yyyy') AND J.Argentina(+) = TRIM ('D') AND F_OUTER.Iraq = extra.SF(+) AND F_OUTER.harvest_date = N.harvest_date(+) AND F_OUTER.Argentina = N.Argentina(+) AND F_OUTER.Norway = N.Hawaii(+) AND N.Jordon(+) = '0' /
  • 77.
  • 78.
    Q2 The subqueries inthe select clause look like select CASE WHEN F.f1 IS NULL THEN NULL ELSE (SELECT X.f2 FROM X WHERE code_vl = F.f1) END AS f0 from F; and should be merged into the query like: select CASE WHEN F.f1 IS NULL THEN NULL ELSE ( X.f2) END AS f0 from F , X where code_vl(+) = F.f1; select CASE WHEN F.f1 IS NULL THEN NULL ELSE (SELECT X.f2 FROM X WHERE code_vl = F.f2) END AS f0 from F; select CASE WHEN F.f1 IS NULL THEN NULL ELSE ( X.f2) END AS f0 from F , X where code_vl(+) = F.f1;
  • 79.
    Q3 SELECT DISTINCT * FROM FOO.aa, FOO.c c, FOO.d d, FOO.g g WHERE a.planted_date > '01-OCT-08' AND a.planted_date < '03-OCT-08' AND a.pears = 'D' AND a.green_beans = '1' AND a.planted_date = c.planted_date AND a.pears = c.pears AND a.zuchinis = c.zuchinis AND a.brocoli = c.brocoli AND a.planted_date = d.planted_date AND a.pears = d.pears AND a.harvest_size = d.harvest_size AND c.oranges = d.oranges AND c.apples = d.apples AND (d.lemons = 0 OR d.lemons IS NULL) AND a.planted_date = g.planted_date AND a.pears = g.pears AND a.harvest_size = g.harvest_size AND c.oranges = g.oranges AND c.apples = g.apples AND (g.lemons = 0 OR g.lemons IS NULL) AND a.zuchinis = '0236' AND d.apples = g.apples AND d.oranges = g.oranges ORDER BY a.zuchinis, a.brocoli;
  • 80.
  • 81.
    Q3 81 6/27/2013 SELECT *FROM ( SELECT /*+ NO_MERGE */ c.apples, c.oranges, a.harvest_size FROM a, c WHERE a.planted_date = TO_DATE ('02/10/2008', 'dd/mm/yyyy') AND a.pears = 'D' AND a.green_beans = '1' AND a.planted_date = c.planted_date AND a.pears = c.pears AND a.zuchinis = c.zuchinis AND a.brocoli = c.brocoli AND a.zuchinis = '0236' ) X, ( SELECT /*+ NO_MERGE */ d.apples, d.oranges, d.harvest_size FROM d, g WHERE d.planted_date = TO_DATE ('02/10/2008', 'dd/mm/yyyy') AND g.planted_date = TO_DATE ('02/10/2008', 'dd/mm/yyyy') AND g.apples = d.apples AND d.oranges = g.oranges AND d.pears = 'D' AND g.pears = 'D' AND g.pears = d.pears AND g.harvest_size = d.harvest_size AND (d.lemons = 0 OR d.lemons IS NULL) AND (g.lemons = 0 OR g.lemons IS NULL) ) Y WHERE X.oranges = Y.oranges AND X.apples = Y.apples AND X.harvest_size = Y.harvest_size; This final version runs in elapsed 0.33 secs and 12K logical reads down from an original elapsed 4.5 secs and 1M logical reads
  • 82.
    HINTS First join order •LEADING (tab_alias , table_alias … ) 10g (9i use ORDERED, not as good ) • NO_MERGE Then choose join type • USE_NL (table_alias) – Inner Table probed into (2cd in xplan not driving) • USE_HASH (table_alias) – Inner hash result probe into (1st in xplan) • INDEX (tab_alias index_name) (examples http://www.adp-gmbh.ch/blog/2008/01/17.php) 82 6/27/2013
  • 83.
    F F 30% 0.02% S A OD P ODT C OT O LeadingHint, use table alias (not table) F F /*+ Leading (C,O,OT, OD ) */
  • 84.
    Y X LEADING(X,Y) USE_NL(Y) Nested LoopsX and Y Select from X search in Y NL X Y
  • 85.
    Y Hash results LEADING(Y, X )USE_HASH(Y) X Hash Join X and Y Select from X search in Y Hash HJ Y X
  • 86.
    What tools touse to create VST diagrams? • Paper – Modifications messy and difficult • PowerPoint – Can move things around – Sticky connectors – Easy to modify • DB Optimizer – Automatic and still modifiable
  • 87.
    VST Steps Summary 1.Diagramtables 2.Draw connectors for each join 3.Calculate filter ratio 1.If many to many then calculate two table join sizes Execution Path • Start at the most selective join filter • Join to keep the running result set size small Many to Many relationships = problems 6/27/2013 Parent Child Parent Child F F 30% 0.02% S A OD P ODT C OT O
  • 88.
  • 89.
  • 90.
    Summary 1.Database - AAS –Profile database – Use wait interface and graphics – Identify machine, application, database or SQL 2.SQL - VST – Indexes, stats, execution path – Visual SQL Tuning
  • 91.
  • 92.
  • 93.
  • 94.
    Types of Subqueries •subquery – query in where clause – Select 1 from dual where 1 = (select 1 from dual); • correlated subquery – Subquery uses fields from outer query – Select 1 from dual a where 1=(select 1 from dual b where a.dummy=b.dummy) • scalar subquery – Query in select list – Returns 1 value or null , ie scalar – Select (select 1 from dual) from dual; • inline views – Query in from clause – Select 1 from dual a, (select 1 from dual ) b;
  • 95.
  • 96.
    • Layout tablesGraphically – Details tables above Masters – One to one relations side by side – Many to many any which way Many to single value
  • 97.
    Join Set Sizes Jointype max result set size possible notes one-to-scalar A this is equivalent to a filter on A table B returns one value like a max(), min(), count() etc one-to-one min(rA,rB) one-to-many rA Joining from A to B will not increase the result set size many-to-many rA*rB ------------------------- min(ndv(A),ndv(B)) The more duplicates in both tables the greater chance the result set size will explode 97 6/27/2013 We can say a lot about the join set size between two tables just by the join type and the number of rows in the table and NDV in the join column, but the easiest way most often is just to extract the two table joins and run a count(*) on that subset of the query
  • 98.
    Join Filter ratios A BJm=1 Jd ~> 1 FK PK A B Jm <= 1 Jd ~> 1 detail Master Unique index or unique constraint Jd, = join detail ratio , the avg number of rows returned when joining from the master to child Jm = master join ratio, the avg number of rows returned joining from the child into the master. Jm = 1 when PK/FK relations, Jm < 1 possible when unique indexes or unique constraints instead of PK/FK. Jd < 1 rare but acts as filter instead of a multiplier
  • 99.
    Hash Join vsNL Col A Col B Col C Filter & Join Index Col D Table Y Table X Filter Index Join Index Col A Col B Col C Filter Index Join Index Col D Table Y Table X Filter Index Join Index NL HJ Driving Table (smaller set) Drive from Table Y off of set of rows returned from filter on column C Nested loops into Table X on Index on Join Filter results without Index even though index on filter column Create hash result set on Table Y from filter on column C Probe hash result set with rows from filter on table X on column A Filter Index Join Index Build Hash Table Probe Hash Table NL X Y HJ X Y
  • 100.
    Left Deep HJ HJ HJ HJ T1 T2 T3 T4 T1T2 T3 T4 HJ HJ HJ T1 T2 T3 Hashed Hashed probe probe T4 probe Hashed
  • 101.
    Right Deep HJ HJ T4 HJ T3 HJ T2 T1 T2T1 T3 T4 HJ HJ HJ T2 T1 T3 T4 probe hashed hashed hashed probe probe
  • 102.
    Nest Loops leftdeep T1 T2 T3 T4 NL NL NL T1 T2 T3 T4 NL NL NL probed probed probed
  • 103.
    Nest Loops can’tbe right deep T3 T4 T2 T1 NL T1 NL T2 NL T3 T4 probed probed probed NL NL NL
  • 104.
    Bushy T1 T2 HJ NL T1 T2 NL T3 T4 NL T3 T4 NL HJ selectt3id, a.*, b.* from ( select /*+ no_merge */ t2.id t2id, t1.data t1data, t2.data t2data from t1, t2 where t1.id = t2.id ) a, ( select /*+ no_merge */ t3.id t3id, t3.data t3data, t4.data t4data from t3, t4 where t3.id = t4.id ) b where a.t2id=b.t3id /
  • 105.
    Two Table Joins AB A B Left join B B(+) Right join B A(+) A B MAP MAP A B o o
  • 106.
    Two Table Joins AB Left join B B(+) B returns no data, useless in Query Select a.* from a, b where b.field(+) = a.field; A B V A B V Multiplier o o ? Useless Pointless – join on B has no affect if no B cols selected V Pointless – join on B has no affect or multiplies rows from A if no B cols selected B B Multiplier, Useless?
  • 107.
    Exists SELECT * FROM deptd WHERE exists ( SELECT null FROM emp e WHERE e.deptno=d.deptno); SELECT * FROM dept d WHERE d.deptno in ( SELECT deptno FROM emp e ); Select dept.* from emp, dept where emp.deptno= dept.deptno; /* can get duplicates */ dept emp E MAP
  • 108.
    Not Exists SELECT * FROMdept d WHERE not exists ( SELECT null FROM emp e WHERE e.deptno=d.deptno); SELECT * FROM dept d WHERE d.deptno not in ( SELECT deptno FROM emp e and deptno is not null ); SELECT dept.* FROM dept LEFT OUTER JOIN emp ON dept.deptno = emp.deptno WHERE emp.deptno IS NULL; dept emp N MAP
  • 109.
    Drawing Map – Oneto One / One to Many / Many to Many A B N A B o B A A B A B – Outer Joins / Not Exists