topic Re: Performance tips required for following Query: in Application Development and Automation Discussions

Performance tips required for following Query:

Former Member — Wed, 30 Jan 2008 08:42:54 GMT

Hi Experts,

TABLES: vbrk, "Invoice Header

vbrp, "Invoice Details

mkpf, "Material document HEader

mseg, "Material Document Details

aufk, "Production order master

afko. "Header data of PP Orders

TYPES: BEGIN OF t_mseg,

mblnr LIKE mseg-mblnr, "Material document

mjahr LIKE mkpf-mjahr,

budat LIKE mkpf-budat,

bwart LIKE mseg-bwart, "Movement type

matnr LIKE mseg-matnr, "Material number

charg LIKE mseg-charg, "Batch number

lgort LIKE mseg-lgort, "Storage Location

aufnr LIKE mseg-aufnr, "Production order

auart LIKE aufk-auart, "Order type

zmatnr LIKE mseg-matnr, "Converted material

zpaufnr LIKE mseg-aufnr, "Parent Production order

gstri LIKE afko-gstri, "Production Start Date

gltri LIKE afko-gltri, "Production End Date

gsuzi LIKE afko-gsuzi, "Start Time

geuzi LIKE afko-geuzi, "End Time

noday TYPE p DECIMALS 3, "Number of days

totdy TYPE p DECIMALS 3, "Total days

prdqty LIKE afko-igmng, "Total produced quantity

END OF t_mseg.

DATA: w_sdate TYPE d, "Start Date

w_edate TYPE d, "End Date

w_gstri LIKE afko-gstri,

w_gltri LIKE afko-gltri,

w_gsuzi LIKE afko-gsuzi,

w_geuzi LIKE afko-geuzi,

w_duration TYPE p DECIMALS 3,

w_prdqty LIKE afko-igmng.

DATA: BEGIN OF i_vbrk OCCURS 0,

vbeln LIKE vbrk-vbeln, "Billing Document

fkdat LIKE vbrk-fkdat, "Billing Date

vkorg LIKE vbrk-vkorg, "Sales Org

vtweg LIKE vbrk-vtweg, "Dist Channel

END OF i_vbrk,

BEGIN OF i_vbrp OCCURS 0,

vbeln LIKE vbrp-vbeln, "Billing document

posnr LIKE vbrp-posnr, "Billing Item

matnr LIKE vbrp-matnr, "MAterial

charg LIKE vbrp-charg, "Batch Number

fklmg LIKE vbrp-fklmg, "Quantity

spart LIKE vbrp-spart, "Division

werks LIKE vbrp-werks, "Plant

bwtar LIKE vbrp-bwtar, "Valuation type

noday TYPE p DECIMALS 3, "Number of days

aufnr LIKE afko-aufnr,

gstri LIKE afko-gstri,

gltri LIKE afko-gltri,

gsuzi LIKE afko-gsuzi,

geuzi LIKE afko-geuzi,

igmng LIKE afko-igmng,

auart LIKE aufk-auart,

END OF i_vbrp,

BEGIN OF i_matnr OCCURS 0,

matnr LIKE vbrp-matnr,

werks LIKE vbrp-werks,

charg LIKE vbrp-charg, "Gyan3001

END OF i_matnr,

i_mseg TYPE SORTED TABLE OF t_mseg WITH NON-UNIQUE KEY matnr charg bwart lgort WITH HEADER LINE,

i_mseg2 TYPE SORTED TABLE OF t_mseg WITH NON-UNIQUE KEY matnr charg bwart lgort WITH HEADER LINE,

i_mseg1 TYPE SORTED TABLE OF t_mseg WITH NON-UNIQUE KEY zmatnr charg WITH HEADER LINE.

data: idx type sy-tabix.

Selection Input

SELECTION-SCREEN: BEGIN OF BLOCK blk1 WITH FRAME TITLE text-001.

*PARAMETERS p_bukrs LIKE bsis-bukrs.

SELECT-OPTIONS: s_date FOR mkpf-budat. " default sy-datum.

SELECTION-SCREEN: END OF BLOCK blk1.

w_sdate = s_date-low.

w_edate = s_date-high.

START-OF-SELECTION.

Collection of Invoice header data

SELECT vbrk~vbeln

vbrk~fkdat

vbrk~vkorg

vbrk~vtweg

INTO TABLE i_vbrk

FROM vbrk

WHERE fkdat >= w_sdate

AND fkdat <= w_edate.

Collecting Data from VBRP

IF NOT i_vbrk[] IS INITIAL.

SELECT vbrp~vbeln

vbrp~posnr

vbrp~matnr

vbrp~charg

vbrp~fklmg

vbrp~spart

vbrp~werks

vbrp~bwtar

INTO CORRESPONDING FIELDS OF TABLE i_vbrp

FROM vbrp

FOR ALL ENTRIES IN i_vbrk

WHERE vbrp~vbeln = i_vbrk-vbeln

AND vbrp~fklmg > 0.

ENDIF.

FREE: i_vbrk.

DELETE i_vbrp WHERE charg IS INITIAL.

*----

Start - Logic to be appended in the user exit

LOOP AT i_vbrp.

CLEAR i_matnr.

i_matnr-matnr = i_vbrp-matnr.

i_matnr-charg = i_vbrp-charg. "Gyan3001

IF i_vbrp-bwtar = ' ' OR i_vbrp-bwtar = 'INT-SFG'.

i_matnr-werks = i_vbrp-werks.

ELSE.

i_matnr-werks = i_vbrp-bwtar.

ENDIF.

COLLECT i_matnr.

ENDLOOP.

IF i_matnr[] IS NOT INITIAL.

SELECT mkpf~mblnr

mkpf~mjahr

mkpf~budat

mseg~bwart

mseg~matnr

mseg~charg

mseg~lgort

mseg~aufnr

INTO TABLE i_mseg

FROM mseg

INNER JOIN mkpf ON mkpf_{mblnr = mseg}mblnr

AND mkpf_{mjahr = mseg}mjahr

FOR ALL entries IN i_matnr

WHERE mseg~matnr = i_matnr-matnr

AND mseg~werks = i_matnr-werks

AND mseg~charg = i_matnr-charg "Gyan3001

AND mseg~bwart = '101'

AND mseg~lgort = 'PP01'

AND mkpf~budat <= w_edate.

ENDIF.

Above program query is taking huge time to fetch data:

Anybody suggest any performance tips.

Re: Performance tips required for following Query:

Former Member — Wed, 30 Jan 2008 12:25:22 GMT

what is slow and what is fast

Please run the SQL Trace at least two time, check the SQL statement summary and show the Top 10 in the list, what takes longest, how long, how many records are read?

see

/people/siegfried.boes/blog/2007/09/05/the-sql-trace-st05-150-quick-and-easy

Your last SELECT seems to be o.k.

Siegfried

Re: Performance tips required for following Query:

Former Member — Wed, 30 Jan 2008 14:32:20 GMT

A couple of things:

The first SELECT (against VBRK) doesn't use an index. So this will be slow. But SD billing and FI are related. BKPF is indexed on posting date. You may be able use the FI document to get the information you need here. See [Quickly Retrieving FI document Data from BSEG|/people/rob.burbank/blog/2007/11/12/quickly-retrieving-fi-document-data-from-bseg]

The last SELECT (the JOIN on MKPF and MSEG) is using a portion of a non-unique index and should be pretty good. One thing I would try would be to move the fields you are SELECTing from in I_MATNR to another internal table and DELETE ADJACENT DUPLICATES from this table before using it in the SELECT.

Rob

Re: Performance tips required for following Query:

Former Member — Mon, 04 Feb 2008 04:39:00 GMT

the performance of the report allways mainly effects on the DATA BASE LOAD

if your program writen logic in better way then its works finely

see these points to improve performance

Ways of Performance Tuning

1. Selection Criteria

2. Select Statements

• Select Queries

• SQL Interface

• Aggregate Functions

• For all Entries

Select Over more than one internal table

Selection Criteria

1. Restrict the data to the selection criteria itself, rather than filtering it out using the ABAP code using CHECK statement.

2. Select with selection list.

SELECT * FROM SBOOK INTO SBOOK_WA.

CHECK: SBOOK_WA-CARRID = 'LH' AND

SBOOK_WA-CONNID = '0400'.

ENDSELECT.

The above code can be much more optimized by the code written below which avoids CHECK, selects with selection list

SELECT CARRID CONNID FLDATE BOOKID FROM SBOOK INTO TABLE T_SBOOK

WHERE SBOOK_WA-CARRID = 'LH' AND

SBOOK_WA-CONNID = '0400'.

Select Statements Select Queries

1. Avoid nested selects

SELECT * FROM EKKO INTO EKKO_WA.

SELECT * FROM EKAN INTO EKAN_WA

WHERE EBELN = EKKO_WA-EBELN.

ENDSELECT.

The above code can be much more optimized by the code written below.

SELECT P_{F1 P}F2 F_{F3 F}F4 INTO TABLE ITAB

FROM EKKO AS P INNER JOIN EKAN AS F

ON P_{EBELN = F}EBELN.

Note: A simple SELECT loop is a single database access whose result is passed to the ABAP program line by line. Nested SELECT loops mean that the number of accesses in the inner loop is multiplied by the number of accesses in the outer loop. One should therefore use nested SELECT loops only if the selection in the outer loop contains very few lines or the outer loop is a SELECT SINGLE statement.

2. Select all the records in a single shot using into table clause of select statement rather than to use Append statements.

SELECT * FROM SBOOK INTO SBOOK_WA.

CHECK: SBOOK_WA-CARRID = 'LH' AND

SBOOK_WA-CONNID = '0400'.

ENDSELECT.

The above code can be much more optimized by the code written below which avoids CHECK, selects with selection list and puts the data in one shot using into table

SELECT CARRID CONNID FLDATE BOOKID FROM SBOOK INTO TABLE T_SBOOK

WHERE SBOOK_WA-CARRID = 'LH' AND

SBOOK_WA-CONNID = '0400'.

3. When a base table has multiple indices, the where clause should be in the order of the index, either a primary or a secondary index.

To choose an index, the optimizer checks the field names specified in the where clause and then uses an index that has the same order of the fields. In certain scenarios, it is advisable to check whether a new index can speed up the performance of a program. This will come handy in programs that access data from the finance tables.

4. For testing existence, use Select.. Up to 1 rows statement instead of a Select-Endselect-loop with an Exit.

SELECT * FROM SBOOK INTO SBOOK_WA

UP TO 1 ROWS

WHERE CARRID = 'LH'.

ENDSELECT.

The above code is more optimized as compared to the code mentioned below for testing existence of a record.

SELECT * FROM SBOOK INTO SBOOK_WA

WHERE CARRID = 'LH'.

EXIT.

ENDSELECT.

5. Use Select Single if all primary key fields are supplied in the Where condition .

If all primary key fields are supplied in the Where conditions you can even use Select Single.

Select Single requires one communication with the database system, whereas Select-Endselect needs two.

Select Statements SQL Interface

1. Use column updates instead of single-row updates

to update your database tables.

SELECT * FROM SFLIGHT INTO SFLIGHT_WA.

SFLIGHT_WA-SEATSOCC =

SFLIGHT_WA-SEATSOCC - 1.

UPDATE SFLIGHT FROM SFLIGHT_WA.

ENDSELECT.

The above mentioned code can be more optimized by using the following code

UPDATE SFLIGHT

SET SEATSOCC = SEATSOCC - 1.

2. For all frequently used Select statements, try to use an index.

SELECT * FROM SBOOK CLIENT SPECIFIED INTO SBOOK_WA

WHERE CARRID = 'LH'

AND CONNID = '0400'.

ENDSELECT.

The above mentioned code can be more optimized by using the following code

SELECT * FROM SBOOK CLIENT SPECIFIED INTO SBOOK_WA

WHERE MANDT IN ( SELECT MANDT FROM T000 )

AND CARRID = 'LH'

AND CONNID = '0400'.

ENDSELECT.

3. Using buffered tables improves the performance considerably.

Bypassing the buffer increases the network considerably

SELECT SINGLE * FROM T100 INTO T100_WA

BYPASSING BUFFER

WHERE SPRSL = 'D'

AND ARBGB = '00'

AND MSGNR = '999'.

The above mentioned code can be more optimized by using the following code

SELECT SINGLE * FROM T100 INTO T100_WA

WHERE SPRSL = 'D'

AND ARBGB = '00'

AND MSGNR = '999'.

Select Statements Aggregate Functions

• If you want to find the maximum, minimum, sum and average value or the count of a database column, use a select list with aggregate functions instead of computing the aggregates yourself.

Some of the Aggregate functions allowed in SAP are MAX, MIN, AVG, SUM, COUNT, COUNT( * )

Consider the following extract.

Maxno = 0.

Select * from zflight where airln = ‘LF’ and cntry = ‘IN’.

Check zflight-fligh > maxno.

Maxno = zflight-fligh.

Endselect.

The above mentioned code can be much more optimized by using the following code.

Select max( fligh ) from zflight into maxno where airln = ‘LF’ and cntry = ‘IN’.

Select Statements For All Entries

• The for all entries creates a where clause, where all the entries in the driver table are combined with OR. If the number of entries in the driver table is larger than rsdb/max_blocking_factor, several similar SQL statements are executed to limit the length of the WHERE clause.

The plus

• Large amount of data

• Mixing processing and reading of data

• Fast internal reprocessing of data

• Fast

The Minus

• Difficult to program/understand

• Memory could be critical (use FREE or PACKAGE size)

Points to be must considered FOR ALL ENTRIES

• Check that data is present in the driver table

• Sorting the driver table

• Removing duplicates from the driver table

Consider the following piece of extract

Loop at int_cntry.

Select single * from zfligh into int_fligh

where cntry = int_cntry-cntry.

Append int_fligh.

Endloop.

The above mentioned can be more optimized by using the following code.

Sort int_cntry by cntry.

Delete adjacent duplicates from int_cntry.

If NOT int_cntry[] is INITIAL.

Select * from zfligh appending table int_fligh

For all entries in int_cntry

Where cntry = int_cntry-cntry.

Endif.

Select Statements Select Over more than one Internal table

1. Its better to use a views instead of nested Select statements.

SELECT * FROM DD01L INTO DD01L_WA

WHERE DOMNAME LIKE 'CHAR%'

AND AS4LOCAL = 'A'.

SELECT SINGLE * FROM DD01T INTO DD01T_WA

WHERE DOMNAME = DD01L_WA-DOMNAME

AND AS4LOCAL = 'A'

AND AS4VERS = DD01L_WA-AS4VERS

AND DDLANGUAGE = SY-LANGU.

ENDSELECT.

The above code can be more optimized by extracting all the data from view DD01V_WA

SELECT * FROM DD01V INTO DD01V_WA

WHERE DOMNAME LIKE 'CHAR%'

AND DDLANGUAGE = SY-LANGU.

ENDSELECT

2. To read data from several logically connected tables use a join instead of nested Select statements. Joins are preferred only if all the primary key are available in WHERE clause for the tables that are joined. If the primary keys are not provided in join the Joining of tables itself takes time.

SELECT * FROM EKKO INTO EKKO_WA.

SELECT * FROM EKAN INTO EKAN_WA

WHERE EBELN = EKKO_WA-EBELN.

ENDSELECT.

The above code can be much more optimized by the code written below.

SELECT P_{F1 P}F2 F_{F3 F}F4 INTO TABLE ITAB

FROM EKKO AS P INNER JOIN EKAN AS F

ON P_{EBELN = F}EBELN.

3. Instead of using nested Select loops it is often better to use subqueries.

SELECT * FROM SPFLI

INTO TABLE T_SPFLI

WHERE CITYFROM = 'FRANKFURT'

AND CITYTO = 'NEW YORK'.

SELECT * FROM SFLIGHT AS F

INTO SFLIGHT_WA

FOR ALL ENTRIES IN T_SPFLI

WHERE SEATSOCC < F~SEATSMAX

AND CARRID = T_SPFLI-CARRID

AND CONNID = T_SPFLI-CONNID

AND FLDATE BETWEEN '19990101' AND '19990331'.

ENDSELECT.

The above mentioned code can be even more optimized by using subqueries instead of for all entries.

SELECT * FROM SFLIGHT AS F INTO SFLIGHT_WA

WHERE SEATSOCC < F~SEATSMAX

AND EXISTS ( SELECT * FROM SPFLI

WHERE CARRID = F~CARRID

AND CONNID = F~CONNID

AND CITYFROM = 'FRANKFURT'

AND CITYTO = 'NEW YORK' )

AND FLDATE BETWEEN '19990101' AND '19990331'.

ENDSELECT.

1. Table operations should be done using explicit work areas rather than via header lines.

READ TABLE ITAB INTO WA WITH KEY K = 'X‘ BINARY SEARCH.

IS MUCH FASTER THAN USING

READ TABLE ITAB INTO WA WITH KEY K = 'X'.

If TAB has n entries, linear search runs in O( n ) time, whereas binary search takes only O( log2( n ) ).

2. Always try to use binary search instead of linear search. But don’t forget to sort your internal table before that.

READ TABLE ITAB INTO WA WITH KEY K = 'X'. IS FASTER THAN USING

READ TABLE ITAB INTO WA WITH KEY (NAME) = 'X'.

3. A dynamic key access is slower than a static one, since the key specification must be evaluated at runtime.

4. A binary search using secondary index takes considerably less time.

5. LOOP ... WHERE is faster than LOOP/CHECK because LOOP ... WHERE evaluates the specified condition internally.

LOOP AT ITAB INTO WA WHERE K = 'X'.

" ...

ENDLOOP.

The above code is much faster than using

LOOP AT ITAB INTO WA.

CHECK WA-K = 'X'.

" ...

ENDLOOP.

6. Modifying selected components using “ MODIFY itab …TRANSPORTING f1 f2.. “ accelerates the task of updating a line of an internal table.

WA-DATE = SY-DATUM.

MODIFY ITAB FROM WA INDEX 1 TRANSPORTING DATE.

The above code is more optimized as compared to

WA-DATE = SY-DATUM.

MODIFY ITAB FROM WA INDEX 1.

7. Accessing the table entries directly in a "LOOP ... ASSIGNING ..." accelerates the task of updating a set of lines of an internal table considerably

Modifying selected components only makes the program faster as compared to Modifying all lines completely.

e.g,

LOOP AT ITAB ASSIGNING <WA>.

I = SY-TABIX MOD 2.

IF I = 0.

<WA>-FLAG = 'X'.

ENDIF.

ENDLOOP.

The above code works faster as compared to

LOOP AT ITAB INTO WA.

I = SY-TABIX MOD 2.

IF I = 0.

WA-FLAG = 'X'.

MODIFY ITAB FROM WA.

ENDIF.

ENDLOOP.

8. If collect semantics is required, it is always better to use to COLLECT rather than READ BINARY and then ADD.

LOOP AT ITAB1 INTO WA1.

READ TABLE ITAB2 INTO WA2 WITH KEY K = WA1-K BINARY SEARCH.

IF SY-SUBRC = 0.

ADD: WA1-VAL1 TO WA2-VAL1,

WA1-VAL2 TO WA2-VAL2.

MODIFY ITAB2 FROM WA2 INDEX SY-TABIX TRANSPORTING VAL1 VAL2.

ELSE.

INSERT WA1 INTO ITAB2 INDEX SY-TABIX.

ENDIF.

ENDLOOP.

The above code uses BINARY SEARCH for collect semantics. READ BINARY runs in O( log2(n) ) time. The above piece of code can be more optimized by

LOOP AT ITAB1 INTO WA.

COLLECT WA INTO ITAB2.

ENDLOOP.

SORT ITAB2 BY K.

COLLECT, however, uses a hash algorithm and is therefore independent

of the number of entries (i.e. O(1)) .

9. "APPEND LINES OF itab1 TO itab2" accelerates the task of appending a table to another table considerably as compared to “ LOOP-APPEND-ENDLOOP.”

APPEND LINES OF ITAB1 TO ITAB2.

This is more optimized as compared to

LOOP AT ITAB1 INTO WA.

APPEND WA TO ITAB2.

ENDLOOP.

10. “DELETE ADJACENT DUPLICATES“ accelerates the task of deleting duplicate entries considerably as compared to “ READ-LOOP-DELETE-ENDLOOP”.

DELETE ADJACENT DUPLICATES FROM ITAB COMPARING K.

This is much more optimized as compared to

READ TABLE ITAB INDEX 1 INTO PREV_LINE.

LOOP AT ITAB FROM 2 INTO WA.

IF WA = PREV_LINE.

DELETE ITAB.

ELSE.

PREV_LINE = WA.

ENDIF.

ENDLOOP.

11. "DELETE itab FROM ... TO ..." accelerates the task of deleting a sequence of lines considerably as compared to “ DO -DELETE-ENDDO”.

DELETE ITAB FROM 450 TO 550.

This is much more optimized as compared to

DO 101 TIMES.

DELETE ITAB INDEX 450.

ENDDO.

12. Copying internal tables by using “ITAB2[ ] = ITAB1[ ]” as compared to “LOOP-APPEND-ENDLOOP”.

ITAB2] = ITAB1[.

This is much more optimized as compared to

REFRESH ITAB2.

LOOP AT ITAB1 INTO WA.

APPEND WA TO ITAB2.

ENDLOOP.

13. Specify the sort key as restrictively as possible to run the program faster.

“SORT ITAB BY K.” makes the program runs faster as compared to “SORT ITAB.”

Internal Tables contd…

Hashed and Sorted tables

1. For single read access hashed tables are more optimized as compared to sorted tables.

2. For partial sequential access sorted tables are more optimized as compared to hashed tables

Hashed And Sorted Tables

Point # 1

Consider the following example where HTAB is a hashed table and STAB is a sorted table

DO 250 TIMES.

N = 4 * SY-INDEX.

READ TABLE HTAB INTO WA WITH TABLE KEY K = N.

IF SY-SUBRC = 0.

" ...

ENDIF.

ENDDO.

This runs faster for single read access as compared to the following same code for sorted table

DO 250 TIMES.

N = 4 * SY-INDEX.

READ TABLE STAB INTO WA WITH TABLE KEY K = N.

IF SY-SUBRC = 0.

" ...

ENDIF.

ENDDO.

Point # 2

Similarly for Partial Sequential access the STAB runs faster as compared to HTAB

LOOP AT STAB INTO WA WHERE K = SUBKEY.

" ...

ENDLOOP.

This runs faster as compared to

LOOP AT HTAB INTO WA WHERE K = SUBKEY.

" ...

ENDLOOP.

hi sir u can follow all these in any kind of queries.it may be helpful to u.

award points if helpful

regards

sravani

Re: Performance tips required for following Query:

Former Member — Wed, 16 Apr 2008 12:45:30 GMT

Hi anee,

1) before using FOR ALL ENTRIES make sure the internal table which you are using is filled otherwise it will fetch all the data from the data base table.

2) instead of writing into corresponding fields define a structure type and than use into table table_name.

3) you have not used any key field while using SELECT on VBRK so it will take time. if possible than add key fields.

reward if helps.

Re: Performance tips required for following Query:

Former Member — Thu, 17 Apr 2008 11:23:20 GMT

Hi Anne,

Besides, you can also avoid using

DELETE i_vbrp WHERE charg IS INITIAL.

Instead, use some other intermediate table, say i_vbrp_temp and select all records in i_vbrp_temp and transfer it to i_vbrp.

sort i_vbrp_temp by charg descending

all non initial will float above

loop at i_vbrp_temp assigning <f_vbrp>.

if <f_vbrp>-charg is initial.

exit.

endif.

i_vbrp = <f_vbrp>.

append i_vbrp

endloop.

free i_vbrp_temp.

Regards,

Mohaiyuddin