Skip to Content

HOW TO IMPROVE PERFORMANCE

HI ALL ,,,

MY SELECT STATEMENT IS LIKE THIS. IN SM30 ITS SHOWING THAT ITS HAS TAKE THE MAXIMUM TIME. SO HOW CAN I REDUCE THE HITING DB TABLE TIME OR IMPROVE THE PERFORMANCE?

IF LT_JCDS[] IS NOT INITIAL.

SELECT OBJNR

WKGBTR

BELNR

WRTTP

BEKNZ

PERIO

GJAHR

VERSN

KOKRS

VRGNG

GKOAR

BUKRS

REFBZ_FI

MBGBTR

FROM COEP

INTO CORRESPONDING FIELDS OF TABLE LT_COEP

FOR ALL ENTRIES IN LT_JCDS

WHERE KOKRS EQ 'DXES'

AND OBJNR EQ LT_JCDS-OBJNR

AND GJAHR <= SO_GJAHR-LOW

AND VERSN eq '000'

AND ( VRGNG EQ 'COIN' OR VRGNG EQ 'RKU1' OR VRGNG EQ 'RKL').

IF SY-SUBRC <> 0.

MESSAGE e000(8i) WITH 'DATA NOT FOUND IN "CO Object: Line Items (by Period)"'.

ENDIF.

ENDIF.

Add a comment
10|10000 characters needed characters exceeded

Assigned Tags

Related questions

9 Answers

  • author's profile photo Former Member
    Former Member
    Posted on Nov 20, 2007 at 12:11 PM

    1. avoid INTO CORRESPONDING FIELDS OF TABLE LT_COEP use into table declaring the fields the same order.

    2. the order of fields , make in the same order of databse

    3. use as much as possible key fields.

    Add a comment
    10|10000 characters needed characters exceeded

  • Posted on Nov 20, 2007 at 12:11 PM

    Hi,

    Use into table statement instead of INTO CORRESPONDING FIELDS OF TABLE LT_COEP and try to use all the keys in where condition.

    Regards,

    Prashant

    Add a comment
    10|10000 characters needed characters exceeded

  • author's profile photo Former Member
    Former Member
    Posted on Nov 20, 2007 at 12:13 PM

    Hi,

    Don't use into corresponding, Declare internal table with required fields and make below line as below

    AND ( VRGNG EQ 'COIN' OR VRGNG EQ 'RKU1' OR VRGNG EQ 'RKL').

    <b>AND VRGNG IN ('COIN', 'RKU1', 'RKL').</b>

    Reward Points if this helps,

    Satish

    Add a comment
    10|10000 characters needed characters exceeded

  • author's profile photo Former Member
    Former Member
    Posted on Nov 20, 2007 at 12:14 PM

    Hi

    see these points

    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.

    Points # 1/2

    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

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

    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.

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

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

    Point # 1

    SELECT * FROM EKKO INTO EKKO_WA.

    SELECT * FROM EKAN INTO EKAN_WA

    WHERE EBELN = EKKO_WA-EBELN.

    ENDSELECT.

    ENDSELECT.

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

    SELECT PF1 PF2 FF3 FF4 INTO TABLE ITAB

    FROM EKKO AS P INNER JOIN EKAN AS F

    ON PEBELN = FEBELN.

    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.

    Point # 2

    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'.

    Point # 3

    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.

    Point # 4

    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.

    Point # 5

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

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

    Select Statements contd.. SQL Interface

    1. Use column updates instead of single-row updates

    to update your database tables.

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

    3. Using buffered tables improves the performance considerably.

    Point # 1

    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.

    Point # 2

    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.

    Point # 3

    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 contd… 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 contd…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 contd… Select Over more than one Internal table

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

    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.

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

    Point # 1

    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

    Point # 2

    SELECT * FROM EKKO INTO EKKO_WA.

    SELECT * FROM EKAN INTO EKAN_WA

    WHERE EBELN = EKKO_WA-EBELN.

    ENDSELECT.

    ENDSELECT.

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

    SELECT PF1 PF2 FF3 FF4 INTO TABLE ITAB

    FROM EKKO AS P INNER JOIN EKAN AS F

    ON PEBELN = FEBELN.

    Point # 3

    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.

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

    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.

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

    Point # 2

    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 ) ).

    Point # 3

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

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

    Point # 5

    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.

    Point # 6

    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

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

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

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

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

    Point # 7

    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.

    Point # 8

    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)) .

    Point # 9

    APPEND LINES OF ITAB1 TO ITAB2.

    This is more optimized as compared to

    LOOP AT ITAB1 INTO WA.

    APPEND WA TO ITAB2.

    ENDLOOP.

    Point # 10

    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.

    Point # 11

    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”.

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

    Point # 12

    ITAB2[] = ITAB1[].

    This is much more optimized as compared to

    REFRESH ITAB2.

    LOOP AT ITAB1 INTO WA.

    APPEND WA TO ITAB2.

    ENDLOOP.

    Point # 13

    “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.

    Add a comment
    10|10000 characters needed characters exceeded

  • author's profile photo Former Member
    Former Member
    Posted on Nov 20, 2007 at 12:15 PM

    Hi ,

    You can do one thing

    1)remove into corresponding

    remove AND VERSN eq '000' condition

    AND ( VRGNG EQ 'COIN' OR VRGNG EQ 'RKU1' OR VRGNG EQ 'RKL').

    And you can write a delete statement using this conditions

    and try to use some more

    key fields for fetching

    Regards,

    Siva.

    Add a comment
    10|10000 characters needed characters exceeded

  • author's profile photo Former Member
    Former Member
    Posted on Nov 20, 2007 at 12:17 PM

    Hi,

    1. Check whether all the key fields should be selected or not ?

    2. Try to make the order of selection fields as present in the transparent table.

    3. Try to make the where conditions as per the order in which they present in the table / Indexes.

    4. Dont make all where conditions in a single select statement. Try to avoid redundancy of data by splitting the where condition as per the logic.

    Reward if useful.

    With regards,

    Murugan Arumugam

    Add a comment
    10|10000 characters needed characters exceeded

    • Former Member KaushiK Datta

      Hi,

      I know your problem, You have to use BUKRS & WERKS in your where clause

      That is the main problem with COEP Table.

      use buzei also in where clause.

      If you dont have any values for those field to compare then pass some blank values like below

      Data: r_buzei TYPE RANGE OF coep-buzei,

      r_bukrs TYPE RANGE OF coep-bukrs,

      r_werks TYPE RANGE OF coep-werks.

      in where clause just use these as

      where bukrs in r_bukrs and werks in r_werks.

      Reward Points if this helps,

      Satish

  • author's profile photo Former Member
    Former Member
    Posted on Nov 20, 2007 at 12:47 PM

    check what are the indexes available, and try to provide those fields,if no indexes available u can create for KOKRS/OBJNR

    Add a comment
    10|10000 characters needed characters exceeded

  • author's profile photo Former Member
    Former Member
    Posted on Nov 20, 2007 at 03:28 PM

    The problem is that you have not included lednr in the WHERE. since it is always '00' in COEP, you can:

    SELECT objnr wkgbtr belnr wrttp beknz perio gjahr versn
           kokrs vrgng gkoar bukrs refbz_fi mbgbtr
      FROM coep
      INTO CORRESPONDING FIELDS OF TABLE lt_coep
      FOR ALL ENTRIES IN lt_jcds
      WHERE lednr EQ '00'            "<======
        AND objnr EQ lt_jcds-objnr
        AND kokrs EQ 'DXES'
        AND gjahr <= so_gjahr-low
        AND versn EQ '000'
        AND ( vrgng EQ 'COIN' OR vrgng EQ 'RKU1' OR vrgng EQ 'RKL').
    

    Rob

    Add a comment
    10|10000 characters needed characters exceeded

  • Posted on Nov 21, 2007 at 02:37 PM

    THANKS ALL

    Add a comment
    10|10000 characters needed characters exceeded

Before answering

You should only submit an answer when you are proposing a solution to the poster's problem. If you want the poster to clarify the question or provide more information, please leave a comment instead, requesting additional details. When answering, please include specifics, such as step-by-step instructions, context for the solution, and links to useful resources. Also, please make sure that you answer complies with our Rules of Engagement.
You must be Logged in to submit an answer.

Up to 10 attachments (including images) can be used with a maximum of 1.0 MB each and 10.5 MB total.