19.06.2013 Views

DB2 UDB for z/OS Version 8 Performance Topics - IBM Redbooks

DB2 UDB for z/OS Version 8 Performance Topics - IBM Redbooks

DB2 UDB for z/OS Version 8 Performance Topics - IBM Redbooks

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

3.1.5 Conclusion<br />

The per<strong>for</strong>mance improvement with multi-row insert is not as high as with multi-row fetch<br />

since a row insert is more complex and costly than a row fetch.<br />

The per<strong>for</strong>mance improvement using multi-row insert depends on:<br />

► Number of rows inserted in one insert SQL statement<br />

► Number of columns inserted (more improvement with fewer columns), data type and size<br />

of columns.<br />

► Number of indexes on the table<br />

► For single-row insert, the measured CPU cost in V8 is the same as V7.<br />

Multi-row fetch/update per<strong>for</strong>mance<br />

Multi-row fetch/update measurements, where the whole rowset was updated, show a<br />

behavior similar to multi-row fetch. The measurement values are in Table 3-1.<br />

► Measurements, compared to V7, show<br />

– 25% CPU time improvement with MR=10 rows<br />

– 40% CPU time improvement with MR=100+ rows<br />

The per<strong>for</strong>mance improvement is not as high as MR fetch since a row cursor update is more<br />

complex and costly than a row fetch.<br />

► Per<strong>for</strong>mance improvement depends on<br />

– Number of rows fetched/updated in one SQL statement<br />

– Number of columns fetched/updated<br />

– Complexity of the fetch/update SQL statement<br />

– Number of indexes updated<br />

Multi-row fetch/delete per<strong>for</strong>mance<br />

Multi-row fetch/delete measurements show a behavior similar to multi-row fetch. The<br />

measurement values are in Table 3-1.<br />

Measurements, compared to V7, show<br />

► 25% CPU time improvement with MR=10 rows<br />

► 35% CPU time improvement with MR=100+ rows<br />

Per<strong>for</strong>mance improvement is not as high as MR fetch since a row cursor delete is more<br />

complex and costly than a row fetch.<br />

The per<strong>for</strong>mance improvement depends on:<br />

► Number of rows fetched/deleted in one SQL statement<br />

► Number of columns fetched<br />

► Complexity of the fetch/delete SQL statement<br />

► Number of indexes on the table<br />

Multi-row operations allow <strong>DB2</strong> V8 to reduce the traffic between the application program and<br />

<strong>DB2</strong> when compared to single-row operations. The measurements show better per<strong>for</strong>mance<br />

improvement in the case of statements with:<br />

► Less complex SQL and data types<br />

► Fewer columns processed<br />

Chapter 3. SQL per<strong>for</strong>mance 37

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!