Operation Selection Configuration - Please Explain

I was looking for an example in the ALSB Book (Apress) or through ALSB documentation and cannot find a good definition of the different selections for the "Operation Selection Configuration". The Operation Algorithm (when configuring a Proxy Service) gives the following options:
Transport Header
SOAPAction Header
WS-Addressing
SOAP Header
SOAP Body Type
The default used is SOAP Body Type. I know that SOAPAction relates to a SOAPAction being defined in the WSDL, which doesn't seem to matter because if my WSDL has SOAPAction defined and I use a client to send a SOAP Request with a bogus Action...I still get a response. So I am definitely confused on what these selections detail and how they are effected by the type of information a calling client includes.
Thanks -jay

I should have explained that I already knew that.
The thing is that the service still works if you select one of the other options even though I am not sending any WS-Adress information or I don't have a SOAP Action and they still work.

Similar Messages

  • Error in sales order when selecting a warranty item in configurator 'Please enter required information - Service Reference Type Code'

    Error in sales order when selecting a warranty item in configurator 'Please enter required information - Service Reference Type Code'
    Not able to book the sales order because of this issue

    Order Management does not support the inclusion of optional service items in a configured Model BOM (see Support article #1296751.1 for more detail).  Allowing for such would therefore require customization.
    As you've found, there's no modeling restriction that prevents you from creating a Model BOM that includes optional service items, nor is there any problem with creating a Configurator Model for it.  And required service items (such as a warranty item that is a required child of an optional BOM component) do not present a problem; they have nothing to do with Configurator, and would never appear as sub-lines in OM.  The problem arises in OM, which requires that any service item be "associated" to the item it's "servicing".  OM does not automatically make such an association with service sub-lines, even though it might be argued that an association may be inferred by the BOM structure (i.e., OM does not assume that an optional service sub-line is necessarily associated, from a service standpoint, with its BOM parent).  OM customization is therefore required in order to hook any service item up to its corresponding product item.  Many customers who configure service along with product have implemented such a customization.
    (Another gap in such a solution that may be relevant to you is that for an included optional service item requiring recurring billing, Order Management does not create the requisite Service Contract.  Customers have likewise developed customizations to address this, as well.)
    As this is not specifically a Configurator matter (you could have created your order without using Configurator at all, and you would have experienced the exact same behavior), please do not take my explanation as being either authoritative or comprehensive (I am a Configurator expert, and only knowledgeable enough about Order Management to be dangerous).  It would be advisable for you to seek more detailed information/recommendations from the Order Management forum.
    Eogan

  • Within Music Library can anyone please explain why when I select the option to sort 'Album by Artist' a number of tracks are being treated as separate albums?  How can I correct this?  I have tried to 'drag and drop' but that doesn't work.

    Within music Library can anyone please explain why after I select the option to sort 'Album by Artist' a number of tracks are being treated as separate albums?  How can I fix this?  I have tried to manually correct by 'drag and drop' individual tracks but that doesn't work.  My music library includes a number of repeat album artwork images simply because not all tracks are being listed under the one album making my library more difficult to use than it should.  Any advise would be appreciated.

    See Grouping tracks into albums.
    tt2

  • Please explain execution of select statement after parsing.

    Can any body explain me what happen when a "select * from emp where ename='sanjay' " statement parsed information is found in shared sql area in library cache.
    Where does the execution phase takes place. Is it in private SQLAREA or shared sql area. Please consider that it is MTS(shared server connection) and also UGA is present in Large Pool.
    Please explain step by step.
    Thank you

    You did not indicate a version number and this is important information especially since the term MTS has been replaced by the term "Shared Servers."
    Perhaps this will help you:
    http://asktom.oracle.com/pls/asktom/f?p=100:11:0::::P11_QUESTION_ID:2588723819082

  • Please explain this select query

    Hello Experts
    please see this select query.
      select  *  from kna1 where lifnr = '1111111101'.
    while debugging how to see what records this above select query has fetched. please explain me.
    Thanks for all the replies

    Hi madan,
    as explained, you need an ENDSELECT which I think you already have. In debugger, you could see the records fetched between SELECT and ENDSELECT but you will probably get a DUMP because a forbidden database access interrupt is detected.
    If your program does not process the records you have no chance to see them.
    A possible solution is:
    data:
      lt_kunnr type table of kna1-kunnr.
    select * from kna1 where lifnr = '1111111101'.
      append kna1-kunnr to lt_kunnr.
    endselect.
    Now you have the primary key KUNNR of all records fetched in table lt_kunnr.
    Regards,
    Clemens

  • Please explain this JOIN

    Hi there,
    I didn't understand how exactly the query ran and what exactly happened.
    Can someone please explain?
    SQL> set autotrace on
    SQL> select salary,department_name,e.department_id,d.department_id from employees e,departments d where e.department_id>d.department_id and first_name like 'K%';
        SALARY DEPARTMENT_NAME                DEPARTMENT_ID DEPARTMENT_ID
         13500 Public Relations                          80            70
         13500 IT                                        80            60
         13500 Shipping                                  80            50
         13500 Human Resources                           80            40
         13500 Purchasing                                80            30
         13500 Marketing                                 80            20
         13500 Administration                            80            10
          2400 Human Resources                           50            40
          2400 Purchasing                                50            30
          2400 Marketing                                 50            20
          2400 Administration                            50            10
        SALARY DEPARTMENT_NAME                DEPARTMENT_ID DEPARTMENT_ID
          3000 Human Resources                           50            40
          3000 Purchasing                                50            30
          3000 Marketing                                 50            20
          3000 Administration                            50            10
          3800 Human Resources                           50            40
          3800 Purchasing                                50            30
          3800 Marketing                                 50            20
          3800 Administration                            50            10
          5800 Human Resources                           50            40
          5800 Purchasing                                50            30
          5800 Marketing                                 50            20
        SALARY DEPARTMENT_NAME                DEPARTMENT_ID DEPARTMENT_ID
          5800 Administration                            50            10
          2500 Marketing                                 30            20
          2500 Administration                            30            10
    25 rows selected.
    Execution Plan
    Plan hash value: 3586199209
    | Id  | Operation           | Name        | Rows  | Bytes | Cost (%CPU)| Time
      |
    |   0 | SELECT STATEMENT    |             |     9 |   612 |     8  (25)| 00:00:0
    1 |
    |   1 |  MERGE JOIN         |             |     9 |   612 |     8  (25)| 00:00:0
    1 |
    |   2 |   SORT JOIN         |             |     7 |   266 |     4  (25)| 00:00:0
    1 |
    |*  3 |    TABLE ACCESS FULL| EMPLOYEES   |     7 |   266 |     3   (0)| 00:00:0
    1 |
    |*  4 |   SORT JOIN         |             |    27 |   810 |     4  (25)| 00:00:0
    1 |
    |   5 |    TABLE ACCESS FULL| DEPARTMENTS |    27 |   810 |     3   (0)| 00:00:0
    1 |
    Predicate Information (identified by operation id):
       3 - filter("FIRST_NAME" LIKE 'K%')
       4 - access(INTERNAL_FUNCTION("E"."DEPARTMENT_ID")>INTERNAL_FUNCTION("D".
                  "DEPARTMENT_ID"))
           filter(INTERNAL_FUNCTION("E"."DEPARTMENT_ID")>INTERNAL_FUNCTION("D".
                  "DEPARTMENT_ID"))
    Note
       - dynamic sampling used for this statement
    Statistics
              0  recursive calls
              0  db block gets
              7  consistent gets
              0  physical reads
              0  redo size
           1292  bytes sent via SQL*Net to client
            395  bytes received via SQL*Net from client
              3  SQL*Net roundtrips to/from client
              2  sorts (memory)
              0  sorts (disk)
             25  rows processedPS: JOIN has to be done with '=' operator. Is this correct?
    Thanks
    Rajiv

    Dear Rajiv,
    Because you make a join with > sign
    Oracle decide
    First - search all EMPLOYEES that match you filter condition first_name like 'K%' and ordering then by departament id
    Then - Oracle sort all departament on dept table by id
    With both sets Sorted, Oracle simply go to one set and check another set, and join then.
    Regards
    Helio Dias
    www.heliodias.com

  • Please explain this behavior

    hi,
    can any one please explain this behavior.
    This is what i did.
    create table temp as select * from dba_extents;
    insert into temp select * from dba_extents;
    insert into temp select * from dba_extents;
    insert into temp select * from dba_extents;
    insert into temp select * from temp;
    insert into temp select * from temp;
    insert into temp select * from temp;
    commit;
    temp table now has arround 8449024 rows
    collected all the statistics now
    the following are the various waits for the session
    EVENT TOTAL_WAITS TOTAL_TIMEOUTS TIME_WAITED AVERAGE_WAIT
    direct path sync 1 0 1 .75
    db file sequential read 22983 0 361 .02
    db file scattered read 9145 0 101 .01
    db file single write 6 0 0 .03
    db file parallel read 8 0 0 .04
    direct path read 22352 0 2883 .13
    direct path write 8 0 0 .02
    now i issued select statement
    select count(distinct block_id) from temp;
    EVENT TOTAL_WAITS TOTAL_TIMEOUTS TIME_WAITED AVERAGE_WAIT
    direct path sync 1 0 1 .75
    db file sequential read 22983 0 361 .02
    db file scattered read 9145 0 101 .01
    db file single write 6 0 0 .03
    db file parallel read 8 0 0 .04
    direct path read 26060 0 2966 .11
    direct path write 8 0 0 .02
    the select statement was actually making the full table scan of the table and the explain plan showed as below
    PLAN_TABLE_OUTPUT
    Plan hash value: 1647884052
    | Id | Operation | Name | Rows | Bytes | Cost (%CPU)| Time |
    | 0 | SELECT STATEMENT | | 1 | 13 | 21612 (2)| 00:04:20 |
    | 1 | SORT AGGREGATE | | 1 | 13 | | |
    | 2 | VIEW | VW_DAG_0 | 5684 | 73892 | 21612 (2)| 00:04:20 |
    | 3 | HASH GROUP BY | | 5684 | 28420 | 21612 (2)| 00:04:20 |
    | 4 | TABLE ACCESS FULL| TEMP | 8449K| 40M| 21340 (1)| 00:04:17 |
    11 rows selected.
    SQL> select owner,object_name from dba_objects where owner='VISHNU';
    OWNER
    OBJECT_NAME
    VISHNU
    PLAN_TABLE
    VISHNU
    TEMP
    VISHNU
    SYS_LOB0000073414C00036$$
    SQL> select owner from dba_objects where owner='VW_DAG_0';
    no rows selected
    can any one please explain this behavior.
    1. oracle tells us that when the full table scans are performed db file scattered event appears but here clearly db file parallel read was occuring.
    2. as the table was going through the full table scan as oracle 11gr2 default behavior will not cache the blocks that are part of the table going through the full table scan is this the reason why the db file parallel read wait event was occuring.
    3. clearly in the explain plan it used a view called VW_DAG_0 which is inexistant on the database is this a bug or this is the behavior of oracle optimizer to create a view.
    4. before collecting any statistics on the table when the same sql statement to count is executed a lot of db file parallel read waits appeared, can any one please explain this behavior.
    5. while doing the full table scans if the oracle shows the waits as db file parallel read (occurs when the recovery or parallel processes are used), but is this behavior changed.
    finally,
    6. can any one please explain the difference between the db file parallel read and db file scattered read.
    BANNER
    Oracle Database 11g Enterprise Edition Release 11.2.0.1.0 - Production
    PL/SQL Release 11.2.0.1.0 - Production
    CORE 11.2.0.1.0 Production
    TNS for Linux: Version 11.2.0.1.0 - Production
    NLSRTL Version 11.2.0.1.0 - Production

    SQL ID: ff1a7d4fgcgnb
    Plan Hash: 2024630721
    create table temp as select * from dba_extents
    call count cpu elapsed disk query current rows
    Parse 1 0.27 0.27 0 0 0 0
    Execute 1 3.44 3.69 5157 24380 393 8262
    Fetch 0 0.00 0.00 0 0 0 0
    total 2 3.71 3.96 5157 24380 393 8262
    Misses in library cache during parse: 1
    Optimizer mode: ALL_ROWS
    Parsing user id: 85
    Rows Row Source Operation
    0 LOAD AS SELECT (cr=40860 pr=5157 pw=77 time=0 us)
    8262 VIEW DBA_EXTENTS (cr=40583 pr=5157 pw=0 time=3945962 us cost=1915 size=4550182 card=25001)
    8262 UNION-ALL (cr=40583 pr=5157 pw=0 time=3927787 us)
    0 NESTED LOOPS (cr=161 pr=0 pw=0 time=0 us cost=862 size=228 card=1)
    0 NESTED LOOPS (cr=161 pr=0 pw=0 time=0 us cost=22 size=100 card=1)
    0 TABLE ACCESS FULL UET$ (cr=161 pr=0 pw=0 time=0 us cost=22 size=91 card=1)
    0 TABLE ACCESS BY INDEX ROWID FILE$ (cr=0 pr=0 pw=0 time=0 us cost=0 size=9 card=1)
    0 INDEX UNIQUE SCAN I_FILE2 (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 44)
    0 VIEW SYS_DBA_SEGS (cr=0 pr=0 pw=0 time=0 us cost=840 size=128 card=1)
    0 UNION ALL PUSHED PREDICATE (cr=0 pr=0 pw=0 time=0 us)
    0 NESTED LOOPS (cr=0 pr=0 pw=0 time=0 us cost=828 size=161 card=1)
    0 NESTED LOOPS OUTER (cr=0 pr=0 pw=0 time=0 us cost=827 size=147 card=1)
    0 NESTED LOOPS (cr=0 pr=0 pw=0 time=0 us cost=826 size=128 card=1)
    0 NESTED LOOPS (cr=0 pr=0 pw=0 time=0 us cost=824 size=95 card=1)
    0 NESTED LOOPS (cr=0 pr=0 pw=0 time=0 us cost=823 size=675 card=9)
    0 INDEX UNIQUE SCAN I_FILE2 (cr=0 pr=0 pw=0 time=0 us cost=0 size=6 card=1)(object id 44)
    0 VIEW SYS_OBJECTS (cr=0 pr=0 pw=0 time=0 us cost=823 size=621 card=9)
    0 UNION-ALL (cr=0 pr=0 pw=0 time=0 us)
    0 TABLE ACCESS FULL TAB$ (cr=0 pr=0 pw=0 time=0 us cost=201 size=22 card=1)
    0 TABLE ACCESS FULL TABPART$ (cr=0 pr=0 pw=0 time=0 us cost=2 size=15 card=1)
    0 TABLE ACCESS FULL CLU$ (cr=0 pr=0 pw=0 time=0 us cost=199 size=14 card=1)
    0 TABLE ACCESS FULL IND$ (cr=0 pr=0 pw=0 time=0 us cost=201 size=19 card=1)
    0 TABLE ACCESS FULL INDPART$ (cr=0 pr=0 pw=0 time=0 us cost=3 size=15 card=1)
    0 TABLE ACCESS FULL LOB$ (cr=0 pr=0 pw=0 time=0 us cost=201 size=20 card=1)
    0 TABLE ACCESS FULL TABSUBPART$ (cr=0 pr=0 pw=0 time=0 us cost=2 size=52 card=1)
    0 TABLE ACCESS FULL INDSUBPART$ (cr=0 pr=0 pw=0 time=0 us cost=2 size=52 card=1)
    0 TABLE ACCESS FULL LOBFRAG$ (cr=0 pr=0 pw=0 time=0 us cost=2 size=17 card=1)
    0 TABLE ACCESS CLUSTER SEG$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=20 card=1)
    0 INDEX UNIQUE SCAN I_FILE#_BLOCK# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 9)
    0 TABLE ACCESS BY INDEX ROWID OBJ$ (cr=0 pr=0 pw=0 time=0 us cost=2 size=33 card=1)
    0 INDEX RANGE SCAN I_OBJ1 (cr=0 pr=0 pw=0 time=0 us cost=1 size=0 card=1)(object id 36)
    0 TABLE ACCESS CLUSTER USER$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=19 card=1)
    0 INDEX UNIQUE SCAN I_USER# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 11)
    0 TABLE ACCESS CLUSTER TS$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=14 card=1)
    0 INDEX UNIQUE SCAN I_TS# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 7)
    0 NESTED LOOPS OUTER (cr=0 pr=0 pw=0 time=0 us cost=5 size=95 card=1)
    0 NESTED LOOPS (cr=0 pr=0 pw=0 time=0 us cost=4 size=76 card=1)
    0 MERGE JOIN CARTESIAN (cr=0 pr=0 pw=0 time=0 us cost=3 size=53 card=1)
    0 NESTED LOOPS (cr=0 pr=0 pw=0 time=0 us cost=2 size=39 card=1)
    0 INDEX UNIQUE SCAN I_FILE2 (cr=0 pr=0 pw=0 time=0 us cost=0 size=6 card=1)(object id 44)
    0 TABLE ACCESS FULL UNDO$ (cr=0 pr=0 pw=0 time=0 us cost=2 size=33 card=1)
    0 BUFFER SORT (cr=0 pr=0 pw=0 time=0 us cost=1 size=14 card=1)
    0 TABLE ACCESS CLUSTER TS$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=14 card=1)
    0 INDEX UNIQUE SCAN I_TS# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 7)
    0 TABLE ACCESS CLUSTER SEG$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=23 card=1)
    0 INDEX UNIQUE SCAN I_FILE#_BLOCK# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 9)
    0 TABLE ACCESS CLUSTER USER$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=19 card=1)
    0 INDEX UNIQUE SCAN I_USER# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 11)
    0 NESTED LOOPS OUTER (cr=0 pr=0 pw=0 time=0 us cost=4 size=65 card=1)
    0 NESTED LOOPS (cr=0 pr=0 pw=0 time=0 us cost=3 size=46 card=1)
    0 NESTED LOOPS (cr=0 pr=0 pw=0 time=0 us cost=2 size=23 card=1)
    0 TABLE ACCESS BY INDEX ROWID FILE$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=9 card=1)
    0 INDEX UNIQUE SCAN I_FILE2 (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 44)
    0 TABLE ACCESS CLUSTER TS$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=14 card=1)
    0 INDEX UNIQUE SCAN I_TS# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 7)
    0 TABLE ACCESS CLUSTER SEG$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=23 card=1)
    0 INDEX UNIQUE SCAN I_FILE#_BLOCK# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 9)
    0 TABLE ACCESS CLUSTER USER$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=19 card=1)
    0 INDEX UNIQUE SCAN I_USER# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 11)
    8262 NESTED LOOPS (cr=40422 pr=5157 pw=0 time=3893345 us cost=896 size=6400000 card=25000)
    5409 HASH JOIN (cr=18394 pr=70 pw=0 time=12576 us cost=895 size=495 card=3)
    5409 VIEW SYS_DBA_SEGS (cr=18391 pr=70 pw=0 time=243234 us cost=892 size=468 card=3)
    5409 UNION-ALL (cr=18391 pr=70 pw=0 time=236820 us)
    5398 NESTED LOOPS OUTER (cr=18172 pr=70 pw=0 time=224038 us cost=850 size=161 card=1)
    5398 NESTED LOOPS (cr=12770 pr=70 pw=0 time=141702 us cost=849 size=142 card=1)
    5398 HASH JOIN (cr=10992 pr=65 pw=0 time=27110 us cost=847 size=109 card=1)
    5409 NESTED LOOPS (cr=5578 pr=0 pw=0 time=115706 us cost=23 size=40 card=1)
    5409 NESTED LOOPS (cr=165 pr=0 pw=0 time=67914 us cost=22 size=26 card=1)
    5409 TABLE ACCESS FULL SEG$ (cr=161 pr=0 pw=0 time=16978 us cost=22 size=20 card=1)
    5409 INDEX UNIQUE SCAN I_FILE2 (cr=4 pr=0 pw=0 time=0 us cost=0 size=6 card=1)(object id 44)
    5409 TABLE ACCESS CLUSTER TS$ (cr=5413 pr=0 pw=0 time=0 us cost=1 size=14 card=1)
    5409 INDEX UNIQUE SCAN I_TS# (cr=4 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 7)
    8489 VIEW SYS_OBJECTS (cr=5414 pr=65 pw=0 time=42954 us cost=824 size=181746 card=2634)
    8489 UNION-ALL (cr=5414 pr=65 pw=0 time=31637 us)
    2761 TABLE ACCESS FULL TAB$ (cr=1349 pr=64 pw=0 time=9594 us cost=201 size=23540 card=1070)
    88 TABLE ACCESS FULL TABPART$ (cr=4 pr=1 pw=0 time=0 us cost=2 size=1320 card=88)
    10 TABLE ACCESS FULL CLU$ (cr=1349 pr=0 pw=0 time=0 us cost=199 size=140 card=10)
    4660 TABLE ACCESS FULL IND$ (cr=1349 pr=0 pw=0 time=7376 us cost=201 size=25764 card=1356)
    104 TABLE ACCESS FULL INDPART$ (cr=5 pr=0 pw=0 time=0 us cost=3 size=1560 card=104)
    865 TABLE ACCESS FULL LOB$ (cr=1349 pr=0 pw=0 time=7344 us cost=201 size=60 card=3)
    0 TABLE ACCESS FULL TABSUBPART$ (cr=3 pr=0 pw=0 time=0 us cost=2 size=52 card=1)
    0 TABLE ACCESS FULL INDSUBPART$ (cr=3 pr=0 pw=0 time=0 us cost=2 size=52 card=1)
    1 TABLE ACCESS FULL LOBFRAG$ (cr=3 pr=0 pw=0 time=0 us cost=2 size=17 card=1)
    5398 TABLE ACCESS BY INDEX ROWID OBJ$ (cr=1778 pr=5 pw=0 time=0 us cost=2 size=33 card=1)
    5398 INDEX RANGE SCAN I_OBJ1 (cr=1228 pr=0 pw=0 time=0 us cost=1 size=0 card=1)(object id 36)
    5398 TABLE ACCESS CLUSTER USER$ (cr=5402 pr=0 pw=0 time=0 us cost=1 size=19 card=1)
    5398 INDEX UNIQUE SCAN I_USER# (cr=4 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 11)
    11 NESTED LOOPS (cr=58 pr=0 pw=0 time=340 us cost=14 size=95 card=1)
    11 NESTED LOOPS OUTER (cr=43 pr=0 pw=0 time=260 us cost=13 size=81 card=1)
    11 NESTED LOOPS (cr=28 pr=0 pw=0 time=190 us cost=12 size=62 card=1)
    11 NESTED LOOPS (cr=24 pr=0 pw=0 time=140 us cost=12 size=56 card=1)
    11 TABLE ACCESS FULL UNDO$ (cr=3 pr=0 pw=0 time=20 us cost=2 size=330 card=10)
    11 TABLE ACCESS CLUSTER SEG$ (cr=21 pr=0 pw=0 time=0 us cost=1 size=23 card=1)
    11 INDEX UNIQUE SCAN I_FILE#_BLOCK# (cr=10 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 9)
    11 INDEX UNIQUE SCAN I_FILE2 (cr=4 pr=0 pw=0 time=0 us cost=0 size=6 card=1)(object id 44)
    11 TABLE ACCESS CLUSTER USER$ (cr=15 pr=0 pw=0 time=0 us cost=1 size=19 card=1)
    11 INDEX UNIQUE SCAN I_USER# (cr=4 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 11)
    11 TABLE ACCESS CLUSTER TS$ (cr=15 pr=0 pw=0 time=0 us cost=1 size=14 card=1)
    11 INDEX UNIQUE SCAN I_TS# (cr=4 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 7)
    0 NESTED LOOPS (cr=161 pr=0 pw=0 time=0 us cost=25 size=65 card=1)
    0 NESTED LOOPS (cr=161 pr=0 pw=0 time=0 us cost=24 size=51 card=1)
    0 NESTED LOOPS OUTER (cr=161 pr=0 pw=0 time=0 us cost=23 size=42 card=1)
    0 TABLE ACCESS FULL SEG$ (cr=161 pr=0 pw=0 time=0 us cost=22 size=23 card=1)
    0 TABLE ACCESS CLUSTER USER$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=19 card=1)
    0 INDEX UNIQUE SCAN I_USER# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 11)
    0 TABLE ACCESS BY INDEX ROWID FILE$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=9 card=1)
    0 INDEX UNIQUE SCAN I_FILE2 (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 44)
    0 TABLE ACCESS CLUSTER TS$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=14 card=1)
    0 INDEX UNIQUE SCAN I_TS# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 7)
    5 TABLE ACCESS FULL FILE$ (cr=3 pr=0 pw=0 time=0 us cost=2 size=36 card=4)
    8262 FIXED TABLE FIXED INDEX X$KTFBUE (ind:1) (cr=22028 pr=5087 pw=0 time=5544 us cost=1 size=758303 card=8333)
    Elapsed times include waiting on following events:
    Event waited on Times Max. Wait Total Waited
    ---------------------------------------- Waited ---------- ------------
    asynch descriptor resize 3 0.00 0.00
    db file scattered read 4 0.00 0.00
    db file sequential read 5148 0.01 1.51
    Disk file operations I/O 2 0.00 0.00
    direct path write 6 0.00 0.00
    direct path sync 1 0.02 0.02
    SQL*Net message to client 1 0.00 0.00
    SQL*Net message from client 1 11.67 11.67
    SQL ID: 0jh7zzgmva195
    Plan Hash: 587733453
    insert into temp select * from dba_extents
    call count cpu elapsed disk query current rows
    Parse 3 0.28 0.28 0 0 0 0
    Execute 3 6.44 6.22 15262 73584 2321 24838
    Fetch 0 0.00 0.00 0 0 0 0
    total 6 6.72 6.50 15262 73584 2321 24838
    Misses in library cache during parse: 1
    Optimizer mode: ALL_ROWS
    Parsing user id: 85
    Rows Row Source Operation
    0 LOAD TABLE CONVENTIONAL (cr=40826 pr=5088 pw=0 time=0 us)
    8279 VIEW DBA_EXTENTS (cr=40590 pr=5087 pw=0 time=2646667 us cost=1733 size=4550182 card=25001)
    8279 UNION-ALL (cr=40590 pr=5087 pw=0 time=2594580 us)
    0 NESTED LOOPS (cr=161 pr=0 pw=0 time=0 us cost=850 size=241 card=1)
    0 NESTED LOOPS (cr=161 pr=0 pw=0 time=0 us cost=22 size=100 card=1)
    0 TABLE ACCESS FULL UET$ (cr=161 pr=0 pw=0 time=0 us cost=22 size=91 card=1)
    0 TABLE ACCESS BY INDEX ROWID FILE$ (cr=0 pr=0 pw=0 time=0 us cost=0 size=9 card=1)
    0 INDEX UNIQUE SCAN I_FILE2 (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 44)
    0 VIEW SYS_DBA_SEGS (cr=0 pr=0 pw=0 time=0 us cost=828 size=141 card=1)
    0 UNION ALL PUSHED PREDICATE (cr=0 pr=0 pw=0 time=0 us)
    0 NESTED LOOPS (cr=0 pr=0 pw=0 time=0 us cost=819 size=161 card=1)
    0 NESTED LOOPS OUTER (cr=0 pr=0 pw=0 time=0 us cost=818 size=147 card=1)
    0 NESTED LOOPS (cr=0 pr=0 pw=0 time=0 us cost=817 size=128 card=1)
    0 NESTED LOOPS (cr=0 pr=0 pw=0 time=0 us cost=815 size=95 card=1)
    0 NESTED LOOPS (cr=0 pr=0 pw=0 time=0 us cost=814 size=675 card=9)
    0 INDEX UNIQUE SCAN I_FILE2 (cr=0 pr=0 pw=0 time=0 us cost=0 size=6 card=1)(object id 44)
    0 VIEW SYS_OBJECTS (cr=0 pr=0 pw=0 time=0 us cost=814 size=621 card=9)
    0 UNION-ALL (cr=0 pr=0 pw=0 time=0 us)
    0 TABLE ACCESS FULL TAB$ (cr=0 pr=0 pw=0 time=0 us cost=201 size=22 card=1)
    0 TABLE ACCESS FULL TABPART$ (cr=0 pr=0 pw=0 time=0 us cost=2 size=15 card=1)
    0 TABLE ACCESS FULL CLU$ (cr=0 pr=0 pw=0 time=0 us cost=199 size=14 card=1)
    0 TABLE ACCESS FULL IND$ (cr=0 pr=0 pw=0 time=0 us cost=201 size=19 card=1)
    0 TABLE ACCESS FULL INDPART$ (cr=0 pr=0 pw=0 time=0 us cost=3 size=15 card=1)
    0 TABLE ACCESS FULL LOB$ (cr=0 pr=0 pw=0 time=0 us cost=201 size=20 card=1)
    0 TABLE ACCESS FULL TABSUBPART$ (cr=0 pr=0 pw=0 time=0 us cost=2 size=52 card=1)
    0 TABLE ACCESS FULL INDSUBPART$ (cr=0 pr=0 pw=0 time=0 us cost=2 size=52 card=1)
    0 TABLE ACCESS FULL LOBFRAG$ (cr=0 pr=0 pw=0 time=0 us cost=2 size=17 card=1)
    0 TABLE ACCESS CLUSTER SEG$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=20 card=1)
    0 INDEX UNIQUE SCAN I_FILE#_BLOCK# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 9)
    0 TABLE ACCESS BY INDEX ROWID OBJ$ (cr=0 pr=0 pw=0 time=0 us cost=2 size=33 card=1)
    0 INDEX RANGE SCAN I_OBJ1 (cr=0 pr=0 pw=0 time=0 us cost=1 size=0 card=1)(object id 36)
    0 TABLE ACCESS CLUSTER USER$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=19 card=1)
    0 INDEX UNIQUE SCAN I_USER# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 11)
    0 TABLE ACCESS CLUSTER TS$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=14 card=1)
    0 INDEX UNIQUE SCAN I_TS# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 7)
    0 NESTED LOOPS OUTER (cr=0 pr=0 pw=0 time=0 us cost=5 size=95 card=1)
    0 NESTED LOOPS (cr=0 pr=0 pw=0 time=0 us cost=4 size=76 card=1)
    0 MERGE JOIN CARTESIAN (cr=0 pr=0 pw=0 time=0 us cost=3 size=53 card=1)
    0 NESTED LOOPS (cr=0 pr=0 pw=0 time=0 us cost=2 size=39 card=1)
    0 INDEX UNIQUE SCAN I_FILE2 (cr=0 pr=0 pw=0 time=0 us cost=0 size=6 card=1)(object id 44)
    0 TABLE ACCESS FULL UNDO$ (cr=0 pr=0 pw=0 time=0 us cost=2 size=33 card=1)
    0 BUFFER SORT (cr=0 pr=0 pw=0 time=0 us cost=1 size=14 card=1)
    0 TABLE ACCESS CLUSTER TS$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=14 card=1)
    0 INDEX UNIQUE SCAN I_TS# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 7)
    0 TABLE ACCESS CLUSTER SEG$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=23 card=1)
    0 INDEX UNIQUE SCAN I_FILE#_BLOCK# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 9)
    0 TABLE ACCESS CLUSTER USER$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=19 card=1)
    0 INDEX UNIQUE SCAN I_USER# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 11)
    0 NESTED LOOPS OUTER (cr=0 pr=0 pw=0 time=0 us cost=4 size=65 card=1)
    0 NESTED LOOPS (cr=0 pr=0 pw=0 time=0 us cost=3 size=46 card=1)
    0 NESTED LOOPS (cr=0 pr=0 pw=0 time=0 us cost=2 size=23 card=1)
    0 TABLE ACCESS BY INDEX ROWID FILE$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=9 card=1)
    0 INDEX UNIQUE SCAN I_FILE2 (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 44)
    0 TABLE ACCESS CLUSTER TS$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=14 card=1)
    0 INDEX UNIQUE SCAN I_TS# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 7)
    0 TABLE ACCESS CLUSTER SEG$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=23 card=1)
    0 INDEX UNIQUE SCAN I_FILE#_BLOCK# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 9)
    0 TABLE ACCESS CLUSTER USER$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=19 card=1)
    0 INDEX UNIQUE SCAN I_USER# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 11)
    8279 NESTED LOOPS (cr=40429 pr=5087 pw=0 time=2513328 us cost=883 size=6725000 card=25000)
    5410 HASH JOIN (cr=18398 pr=0 pw=0 time=13333 us cost=882 size=534 card=3)
    5410 VIEW SYS_DBA_SEGS (cr=18395 pr=0 pw=0 time=279632 us cost=879 size=507 card=3)
    5410 UNION-ALL (cr=18395 pr=0 pw=0 time=271959 us)
    5399 NESTED LOOPS OUTER (cr=18176 pr=0 pw=0 time=250065 us cost=840 size=161 card=1)
    5399 NESTED LOOPS (cr=12773 pr=0 pw=0 time=153780 us cost=839 size=142 card=1)
    5399 HASH JOIN (cr=10993 pr=0 pw=0 time=50967 us cost=837 size=109 card=1)
    5410 NESTED LOOPS (cr=5579 pr=0 pw=0 time=118117 us cost=23 size=40 card=1)
    5410 NESTED LOOPS (cr=165 pr=0 pw=0 time=55725 us cost=22 size=26 card=1)
    5410 TABLE ACCESS FULL SEG$ (cr=161 pr=0 pw=0 time=9685 us cost=22 size=20 card=1)
    5410 INDEX UNIQUE SCAN I_FILE2 (cr=4 pr=0 pw=0 time=0 us cost=0 size=6 card=1)(object id 44)
    5410 TABLE ACCESS CLUSTER TS$ (cr=5414 pr=0 pw=0 time=0 us cost=1 size=14 card=1)
    5410 INDEX UNIQUE SCAN I_TS# (cr=4 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 7)
    8490 VIEW SYS_OBJECTS (cr=5414 pr=0 pw=0 time=63796 us cost=814 size=181746 card=2634)
    8490 UNION-ALL (cr=5414 pr=0 pw=0 time=42830 us)
    2762 TABLE ACCESS FULL TAB$ (cr=1349 pr=0 pw=0 time=5784 us cost=201 size=23540 card=1070)
    88 TABLE ACCESS FULL TABPART$ (cr=4 pr=0 pw=0 time=0 us cost=2 size=1320 card=88)
    10 TABLE ACCESS FULL CLU$ (cr=1349 pr=0 pw=0 time=0 us cost=199 size=140 card=10)
    4660 TABLE ACCESS FULL IND$ (cr=1349 pr=0 pw=0 time=11906 us cost=201 size=25764 card=1356)
    104 TABLE ACCESS FULL INDPART$ (cr=5 pr=0 pw=0 time=0 us cost=3 size=1560 card=104)
    865 TABLE ACCESS FULL LOB$ (cr=1349 pr=0 pw=0 time=5184 us cost=201 size=60 card=3)
    0 TABLE ACCESS FULL TABSUBPART$ (cr=3 pr=0 pw=0 time=0 us cost=2 size=52 card=1)
    0 TABLE ACCESS FULL INDSUBPART$ (cr=3 pr=0 pw=0 time=0 us cost=2 size=52 card=1)
    1 TABLE ACCESS FULL LOBFRAG$ (cr=3 pr=0 pw=0 time=0 us cost=2 size=17 card=1)
    5399 TABLE ACCESS BY INDEX ROWID OBJ$ (cr=1780 pr=0 pw=0 time=0 us cost=2 size=33 card=1)
    5399 INDEX RANGE SCAN I_OBJ1 (cr=1230 pr=0 pw=0 time=0 us cost=1 size=0 card=1)(object id 36)
    5399 TABLE ACCESS CLUSTER USER$ (cr=5403 pr=0 pw=0 time=0 us cost=1 size=19 card=1)
    5399 INDEX UNIQUE SCAN I_USER# (cr=4 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 11)
    11 NESTED LOOPS (cr=58 pr=0 pw=0 time=720 us cost=14 size=95 card=1)
    11 NESTED LOOPS OUTER (cr=43 pr=0 pw=0 time=580 us cost=13 size=81 card=1)
    11 NESTED LOOPS (cr=28 pr=0 pw=0 time=360 us cost=12 size=62 card=1)
    11 NESTED LOOPS (cr=24 pr=0 pw=0 time=130 us cost=12 size=56 card=1)
    11 TABLE ACCESS FULL UNDO$ (cr=3 pr=0 pw=0 time=10 us cost=2 size=330 card=10)
    11 TABLE ACCESS CLUSTER SEG$ (cr=21 pr=0 pw=0 time=0 us cost=1 size=23 card=1)
    11 INDEX UNIQUE SCAN I_FILE#_BLOCK# (cr=10 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 9)
    11 INDEX UNIQUE SCAN I_FILE2 (cr=4 pr=0 pw=0 time=0 us cost=0 size=6 card=1)(object id 44)
    11 TABLE ACCESS CLUSTER USER$ (cr=15 pr=0 pw=0 time=0 us cost=1 size=19 card=1)
    11 INDEX UNIQUE SCAN I_USER# (cr=4 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 11)
    11 TABLE ACCESS CLUSTER TS$ (cr=15 pr=0 pw=0 time=0 us cost=1 size=14 card=1)
    11 INDEX UNIQUE SCAN I_TS# (cr=4 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 7)
    0 NESTED LOOPS (cr=161 pr=0 pw=0 time=0 us cost=25 size=65 card=1)
    0 NESTED LOOPS (cr=161 pr=0 pw=0 time=0 us cost=24 size=51 card=1)
    0 NESTED LOOPS OUTER (cr=161 pr=0 pw=0 time=0 us cost=23 size=42 card=1)
    0 TABLE ACCESS FULL SEG$ (cr=161 pr=0 pw=0 time=0 us cost=22 size=23 card=1)
    0 TABLE ACCESS CLUSTER USER$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=19 card=1)
    0 INDEX UNIQUE SCAN I_USER# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 11)
    0 TABLE ACCESS BY INDEX ROWID FILE$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=9 card=1)
    0 INDEX UNIQUE SCAN I_FILE2 (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 44)
    0 TABLE ACCESS CLUSTER TS$ (cr=0 pr=0 pw=0 time=0 us cost=1 size=14 card=1)
    0 INDEX UNIQUE SCAN I_TS# (cr=0 pr=0 pw=0 time=0 us cost=0 size=0 card=1)(object id 7)
    5 TABLE ACCESS FULL FILE$ (cr=3 pr=0 pw=0 time=0 us cost=2 size=36 card=4)
    8279 FIXED TABLE FIXED INDEX X$KTFBUE (ind:1) (cr=22031 pr=5087 pw=0 time=10961 us cost=1 size=758303 card=8333)
    Elapsed times include waiting on following events:
    Event waited on Times Max. Wait Total Waited
    ---------------------------------------- Waited ---------- ------------
    asynch descriptor resize 6 0.00 0.00
    db file sequential read 15262 0.00 0.23
    SQL*Net message to client 3 0.00 0.00
    SQL*Net message from client 3 0.00 0.00
    SQL ID: 23wm3kz7rps5y
    Plan Hash: 0
    commit
    call count cpu elapsed disk query current rows
    Parse 2 0.00 0.00 0 0 0 0
    Execute 2 0.00 0.00 0 0 2 0
    Fetch 0 0.00 0.00 0 0 0 0
    total 4 0.00 0.00 0 0 2 0
    Misses in library cache during parse: 0
    Parsing user id: 85
    Elapsed times include waiting on following events:
    Event waited on Times Max. Wait Total Waited
    ---------------------------------------- Waited ---------- ------------
    log file sync 2 0.01 0.01
    SQL*Net message to client 2 0.00 0.00
    SQL*Net message from client 2 17.73 17.73
    SQL ID: fw2rqy6u5zfuz
    Plan Hash: 1896031711
    insert /*APPEND*/ into temp select * from temp
    call count cpu elapsed disk query current rows
    Parse 9 0.00 0.00 0 1 0 0
    Execute 9 41.68 47.27 137424 465979 1377104 16914100
    Fetch 0 0.00 0.00 0 0 0 0
    total 18 41.68 47.27 137424 465980 1377104 16914100
    Misses in library cache during parse: 1
    Optimizer mode: ALL_ROWS
    Parsing user id: 85
    Rows Row Source Operation
    0 LOAD TABLE CONVENTIONAL (cr=1073 pr=82 pw=0 time=0 us)
    33100 TABLE ACCESS FULL TEMP (cr=498 pr=82 pw=0 time=247667 us cost=104 size=5340972 card=29346)
    Elapsed times include waiting on following events:
    Event waited on Times Max. Wait Total Waited
    ---------------------------------------- Waited ---------- ------------
    db file scattered read 1877 0.06 2.59
    db file sequential read 162 0.00 0.01
    SQL*Net message to client 9 0.00 0.00
    SQL*Net message from client 9 1.83 7.39
    undo segment extension 2 0.01 0.01
    log file switch (private strand flush incomplete)
    5 0.01 0.03
    log file switch completion 41 0.14 1.24
    log file switch (checkpoint incomplete) 9 1.00 1.29
    log buffer space 6 0.05 0.09
    db file parallel read 7 0.06 0.07
    reliable message 94 0.00 0.01
    rdbms ipc reply 92 0.00 0.01
    SQL ID: f7nsg2m3xsq5g
    Plan Hash: 750244813
    select distinct owner
    from
    temp
    call count cpu elapsed disk query current rows
    Parse 1 0.00 0.00 0 1 0 0
    Execute 1 0.00 0.00 0 0 0 0
    Fetch 3 11.56 14.49 156820 286796 0 16
    total 5 11.56 14.49 156820 286797 0 16
    Misses in library cache during parse: 1
    Optimizer mode: ALL_ROWS
    Parsing user id: 85
    Rows Row Source Operation
    16 HASH UNIQUE (cr=286796 pr=156820 pw=0 time=0 us cost=54654605 size=124596205299 card=7329188547)
    16947200 TABLE ACCESS FULL TEMP (cr=286796 pr=156820 pw=0 time=58012160 us cost=78220 size=124596205299 card=7329188547)
    Elapsed times include waiting on following events:
    Event waited on Times Max. Wait Total Waited
    ---------------------------------------- Waited ---------- ------------
    SQL*Net message to client 3 0.00 0.00
    reliable message 1 0.00 0.00
    enq: KO - fast object checkpoint 1 1.43 1.43
    direct path read                             2473        0.02          4.84_
    asynch descriptor resize 2 0.00 0.00
    buffer busy waits 1 0.00 0.00
    SQL*Net message from client 3 37.70 37.70

  • Can you please explain about the vehicle management system?

    Hi ,
    i want to know about the module (vehicle management system) .please explain any one in details .
    Regards
    Venkata .

    Hi Venkata,
    The Vehicle Management system (VMS) is part of SAP IS - Auto. Generally it is said that it is used by importers, however I would rather put it like this – It can be used for an importer or a distributor’s business functions. So if an OEM is also performing a distributor’s business, he can also use VMS and get benefited out of it.
    The VMS facilitates to see a Vehicle like a Vehicle in the system.
    Following are the few high level features -
    It allows to capture all the attributes of a  particular vehicle as an unique object in the system
    All the transaction on a vehicle (sales, purchase etc.) can be carried out keeping vehicle as a central object, provides ease of operation to users. All business and technical data of the vehicle is available here.
    Strong configuration based vehicle search and vehicle history (transactions) helps in tracking the vehicle easily for any purpose in the distribution chain of OEMà Distributorà Dealerà End Customer.
    This is in brief about VMS.
    Regards,
    Aseem Baruaole
    Mahindra Satyam

  • Please explain me about pricing determination procedure in SAP SD ?

    Could you please explain me about the pricing determination procedure in SAP SD ?
    Edited by: Piruthiviraja on Aug 18, 2009 8:00 AM

    Hello,
    Please go through the following
    An Overview of Determination & Configuration of Pricing Procedure is as follows:
    In SD, Pricing Procedure is determined based on Sales Area (Sales Organization + Distribution Centre + Division) + Customer Pricing Procedure + Document Pricing Procedure. Sales Area is determined in Sales Order Header Level. Customer Pricing Procedure is determined from Customer Master. Document Pricing Procedure is determined from Sales Document Type / Billing Type (if configured). Once the pricing procedure is determined, Condition records are fetched. If appropriate condition records are found, the price is determined. If Mandatory pricing condition is missing, system will through an error message.
    In SD, the steps to configure Pricing procedure are as under:
    Step 1:
    Condition table: If existing condition table meets the requirement, we need not create a new condition table. Considering the requirement for new condition table, the configuration will be done in spro as follows: IMG u2013> Sales & Distribution u2013> Basic Function u2013> Pricing Control u2013> Condition Table (select the required fields combination, which will store condition record).
    Step 2:
    Access Sequence: If existing access sequence meets the requirement, we need not create a new access sequence. Considering the requirement for new sequence, the configuration will be done in spro as follows: IMG u2013> Sales & Distribution u2013> Basic Function u2013> Pricing Control u2013> Access Sequence (Access sequence is made up of Accesses (Tables) & the order of priority in which it is to be accessed. Here we assign the condition table to access sequence.
    Step 3:
    Condition Type: If existing condition type meets the requirement, we need not create a new condition type. Considering the requirement for new condition type, the configuration will be done in spro as follows: IMG u2013> Sales & Distribution u2013> Basic Function u2013> Pricing Control u2013> Condition Type. It is always recommended to copy an existing similar condition type & make the neccessary changes. Here we assign Access sequence to Condition type.
    Step 4:
    a. Pricing Procedure: It is recommended to copy a similar pricing procedure & make the neccesary changes in new pricing procedure. Pricing Procedure is a set of condition type & arranged in the sequence in which it has to perform the calculation. Considering the requirement for new Pricing Procedure, the configuration will be done in spro as follows: IMG -> Sales & Distribution u2013> Basic Function u2013> Pricing Control u2013> Pricing Procedure -> Maintain Pricing Procedure.
    b. Pricing Procedure: After maintaining the pricing procedure the next step will be determination of pricing procedure. Configuration for determining pricing procedure in SPRO is as follows: IMG -> Sales & Distribution u2013> Basic Function u2013> Pricing Control u2013> Pricing Procedure -> Determine Pricing Procedure.
    Step 5:
    Condition record: Condition record is a master data, which is required to be maintained by Core team / person responsible from the client. During new implementation, the condition records can be uploaded using tools like SCAT, LSMW, etc.
    SANTOSH

  • Please explain me how I can use Form feed(\f) and Carriage return(\r)

    what is Form feed(\f) and Carriage return(\r)?
    Please explain to me.
    Thank you.

    These control characters aren't used much these days except that if you example a Windows or MSDOS text file in a binary editor you'll find each line ends with "\r\n". However when reading or writing text through classes these carriage returns will be added and removed automatically so your program doesn't see them.
    The controlls date back to teletype machines which operated rather like typewriters. Cariage return, as it's name implied, caused the print head to move back to the start of the line, line feed advanced a line (without, necessarilly, returning the carriage) and formfeed skipped to the next page.
    Newline on these machines was always "return, linefeed" because executing the carriage return on these machine could take too long. The early machines had only a single character buffer so that they had to executed the characters as quickly as they arrived. So doing the linefeed after the carriage return gave the carriage more time to return. On some teletypes if you did "linefeed, return" then the first character of the new line would often be printed somewhere in the middle of the line.
    This is the origin of the MSDOS/Windows end of line sequence.
    Many printers will still respect formfeed if printing is direct. Some will take carriage return without linefeed to allow you to start again overprinting the same line.
    However printing, these days, is seldom direct but done in bitmap form.

  • Could you please explain when we connect R/3 system to BW

    Hi,
    could you please explain when we connect R/3 system to BW
    1. Procedure
    2. SAP BW need to do anything
    3. Effort required by  SAP BW
    Regards,
    kranthi

    Hello Kranthi,
    When we need to make a conncetion between R/3 & BW , First logon to R/3 system , Go to T/code - SM59 .
    There u find connections . Select on ABAP and click on New
    Then Provide the description
    Go to technical settings tab :
    Provide load balancing : No
    if you know the server name : give it in the target host name
    or give the IP Address ;
    Then after that go to logon & Security Tab :
    provide the RFC user ID , Client & Password .
    And now check the connection by clicking on the connection test
    If it shows some 2mins ,like that then it is ok ...
    Otherwise then it is a problem ...
    repeat the same thing by giving the target as R/3 here .
    now go the RSA1 , select the source systems , create source systems
    Select BW source systems
    give the target system details , such as system no . System ID ,server name ..
    And also background user id & password for both the target systemm & source system .
    Now Select the created source system , context menu & Check the connection .
    This job is performed with the help of basis people , not only by BW team .
    This is maintaince is done for every system ( Dev , Qaulity & production seperately )
    Thanks
    PT
    Edited by: PT on Dec 9, 2008 11:17 AM

  • Can you please explain how this query is fetching the rows?

    here is a query to find the top 3 salaries. But the thing is that i am now able to understand how its working to get the correct data :How the data in the alias table P1 and P2 getting compared. Can you please explain in some steps.
    SELECT MIN(P1.SAL) FROM PSAL P1, PSAL P2
    WHERE P1.SAL >= P2.SAL
    GROUP BY P2.SAL
    HAVING COUNT (DISTINCT P1.SAL) <=3 ;
    here is the data i used :
    SQL> select * from psal;
    NAME SAL
    able 1000
    baker 900
    charles 900
    delta 800
    eddy 700
    fred 700
    george 700
    george 700
    Regards,
    Renu

    ... Please help me in understanding the query.
    Your query looks like anything but a Top-N query.
    If you run it in steps and analyze the output at the end of each step, then you should be able to understand what it does.
    Given below is some brief information on the same:
    test@ora>
    test@ora> --
    test@ora> -- Query 1 - using the non-equi (theta) join
    test@ora> --
    test@ora> with psal as (
      2    select 'able' as name, 1000 as sal from dual union all
      3    select 'baker',   900 from dual union all
      4    select 'charles', 900 from dual union all
      5    select 'delta',   800 from dual union all
      6    select 'eddy',    700 from dual union all
      7    select 'fred',    700 from dual union all
      8    select 'george',  700 from dual union all
      9    select 'george',  700 from dual)
    10  --
    11  SELECT p1.sal AS p1_sal, p1.NAME AS p1_name, p2.sal AS p2_sal,
    12         p2.NAME AS p2_name
    13    FROM psal p1, psal p2
    14   WHERE p1.sal >= p2.sal;
        P1_SAL P1_NAME     P2_SAL P2_NAME
          1000 able          1000 able
          1000 able           900 baker
          1000 able           900 charles
          1000 able           800 delta
          1000 able           700 eddy
          1000 able           700 fred
          1000 able           700 george
          1000 able           700 george
           900 baker          900 baker
           900 baker          900 charles
           900 baker          800 delta
           900 baker          700 eddy
           900 baker          700 fred
           900 baker          700 george
           900 baker          700 george
           900 charles        900 baker
           900 charles        900 charles
           900 charles        800 delta
           900 charles        700 eddy
           900 charles        700 fred
           900 charles        700 george
           900 charles        700 george
           800 delta          800 delta
           800 delta          700 eddy
           800 delta          700 fred
           800 delta          700 george
           800 delta          700 george
           700 eddy           700 eddy
           700 eddy           700 fred
           700 eddy           700 george
           700 eddy           700 george
           700 fred           700 eddy
           700 fred           700 fred
           700 fred           700 george
           700 fred           700 george
           700 george         700 eddy
           700 george         700 fred
           700 george         700 george
           700 george         700 george
           700 george         700 eddy
           700 george         700 fred
           700 george         700 george
           700 george         700 george
    43 rows selected.
    test@ora>
    test@ora>This query joins PSAL with itself using a non equi-join. Take each row of PSAL p1 and see how it compares with PSAL p2. You'll see that:
    - Row 1 with sal 1000 is >= to all sal values of p2, so it occurs 8 times
    - Row 2 with sal 900 is >= to 9 sal values of p2, so it occurs 7 times
    - Row 3: 7 times again... and so on.
    - So, total no. of rows are: 8 + 7 + 7 + 5 + 4 + 4 + 4 + 4 = 43
    test@ora>
    test@ora> --
    test@ora> -- Query 2 - add the GROUP BY
    test@ora> --
    test@ora> with psal as (
      2    select 'able' as name, 1000 as sal from dual union all
      3    select 'baker',   900 from dual union all
      4    select 'charles', 900 from dual union all
      5    select 'delta',   800 from dual union all
      6    select 'eddy',    700 from dual union all
      7    select 'fred',    700 from dual union all
      8    select 'george',  700 from dual union all
      9    select 'george',  700 from dual)
    10  --
    11  SELECT p2.sal AS p2_sal,
    12         COUNT(*) as cnt,
    13         COUNT(p1.sal) as cnt_p1_sal,
    14         COUNT(DISTINCT p1.sal) as cnt_dist_p1_sal,
    15         MIN(p1.sal) as min_p1_sal,
    16         MAX(p1.sal) as max_p1_sal
    17    FROM psal p1, psal p2
    18   WHERE p1.sal >= p2.sal
    19  GROUP BY p2.sal;
        P2_SAL        CNT CNT_P1_SAL CNT_DIST_P1_SAL MIN_P1_SAL MAX_P1_SAL
           700         32         32               4        700       1000
           800          4          4               3        800       1000
           900          6          6               2        900       1000
          1000          1          1               1       1000       1000
    test@ora>
    test@ora>Now, if you group by p2.sal in the output of query 1, and check the number of distinct p1.sal, min of p1.sal etc. you see that for p2.sal values - 800, 900 and 1000, there are 3 or less p1.sal values associated.
    So, the last 3 rows are the ones you are interested in, essentially. As follows:
    test@ora>
    test@ora> --
    test@ora> -- Query 3 - GROUP BY and HAVING
    test@ora> --
    test@ora> with psal as (
      2    select 'able' as name, 1000 as sal from dual union all
      3    select 'baker',   900 from dual union all
      4    select 'charles', 900 from dual union all
      5    select 'delta',   800 from dual union all
      6    select 'eddy',    700 from dual union all
      7    select 'fred',    700 from dual union all
      8    select 'george',  700 from dual union all
      9    select 'george',  700 from dual)
    10  --
    11  SELECT p2.sal AS p2_sal,
    12         COUNT(*) as cnt,
    13         COUNT(p1.sal) as cnt_p1_sal,
    14         COUNT(DISTINCT p1.sal) as cnt_dist_p1_sal,
    15         MIN(p1.sal) as min_p1_sal,
    16         MAX(p1.sal) as max_p1_sal
    17    FROM psal p1, psal p2
    18   WHERE p1.sal >= p2.sal
    19  GROUP BY p2.sal
    20  HAVING COUNT(DISTINCT p1.sal) <= 3;
        P2_SAL        CNT CNT_P1_SAL CNT_DIST_P1_SAL MIN_P1_SAL MAX_P1_SAL
           800          4          4               3        800       1000
           900          6          6               2        900       1000
          1000          1          1               1       1000       1000
    test@ora>
    test@ora>
    test@ora>That's what you are doing in that query.
    The thing is - in order to find out Top-N values, you simply need to scan that one table PSAL. So, joining it to itself is not necessary.
    A much simpler query is as follows:
    test@ora>
    test@ora>
    test@ora> --
    test@ora> -- Top-3 salaries - distinct or not; using ROWNUM on ORDER BY
    test@ora> --
    test@ora> with psal as (
      2    select 'able' as name, 1000 as sal from dual union all
      3    select 'baker',   900 from dual union all
      4    select 'charles', 900 from dual union all
      5    select 'delta',   800 from dual union all
      6    select 'eddy',    700 from dual union all
      7    select 'fred',    700 from dual union all
      8    select 'george',  700 from dual union all
      9    select 'george',  700 from dual)
    10  --
    11  SELECT sal
    12  FROM (
    13    SELECT sal
    14      FROM psal
    15    ORDER BY sal DESC
    16  )
    17  WHERE rownum <= 3;
           SAL
          1000
           900
           900
    test@ora>
    test@ora>
    test@ora>And for Top-3 distinct salaries:
    test@ora>
    test@ora> --
    test@ora> -- Top-3 DISTINCT salaries; using ROWNUM on ORDER BY on DISTINCT
    test@ora> --
    test@ora> with psal as (
      2    select 'able' as name, 1000 as sal from dual union all
      3    select 'baker',   900 from dual union all
      4    select 'charles', 900 from dual union all
      5    select 'delta',   800 from dual union all
      6    select 'eddy',    700 from dual union all
      7    select 'fred',    700 from dual union all
      8    select 'george',  700 from dual union all
      9    select 'george',  700 from dual)
    10  --
    11  SELECT sal
    12  FROM (
    13    SELECT DISTINCT sal
    14      FROM psal
    15    ORDER BY sal DESC
    16  )
    17  WHERE rownum <= 3;
           SAL
          1000
           900
           800
    test@ora>
    test@ora>
    test@ora>You may also want to check out the RANK and DENSE_RANK analytic functions.
    RANK:
    http://download.oracle.com/docs/cd/B19306_01/server.102/b14200/functions123.htm#SQLRF00690
    DENSE_RANK:
    http://download.oracle.com/docs/cd/B19306_01/server.102/b14200/functions043.htm#SQLRF00633
    HTH
    isotope

  • Hi guru's   i am new to xi  please explain what is correlation in xi

    1) please explain what is correlation in xi ?
    2) what is the xi landscape ?

    hi,
    Refer these links
    /people/sravya.talanki2/blog/2005/08/24/do-you-like-to-understand-147correlation148-in-xi
    http://help.sap.com/saphelp_nw2004s/helpdata/en/a5/64373f7853494fe10000000a114084/frameset.htm
    http://help.sap.com/saphelp_nw2004s/helpdata/en/08/16163ff8519a06e10000000a114084/frameset.htm
    Landscape:
    The SAP System Landscape Directory (SLD) is the central information provider in a system landscape.
    The SLD contains two types of information:
    Component Information: This is information about all available SAP products and components, including their versions. If there are any third-party products in the system landscape, they are also registered here.
    At design time of the integration objects, the component information is extracted from the SLD to define integration scenarios.
    Landscape Description: This contains all installed systems in a system landscape.
    When a collaborative business process is configured, the landscape descriptions are needed to determine the system information of the business partners involved.
    /people/boris.zarske/blog/2006/07/28/ulm206-landscape-strategies-for-the-system-landscape-directory-of-sap-netweaver
    /people/boris.zarske/blog/2008/03/21/sld-general-recommendation-how-to-set-up-the-system-landscape-directory
    http://help.sap.com/saphelp_nw04s/helpdata/en/fe/39ae3d47afd652e10000000a114084/frameset.htm
    http://help.sap.com/saphelp_nw04/helpdata/en/fe/39ae3d47afd652e10000000a114084/frameset.htm
    Regards,
    Nithiyanandam
    Edited by: Nithiyanandam A.U. on May 11, 2009 7:01 AM

  • Please explain the query?

    hello all,
    please explain below query used in solution below, thanks in advance!
    ELECT MAX(P1.ET) AS ST, P2.ST AS ET
    FROM XYZ AS P1
    INNER JOIN XYZ AS P2 ON (P1.ST < P2.ST)
    GROUP BY P2.ST
    HAVING MAX(P1.ET) < P2.ST
    IF OBJECT_ID('XYZ') IS NOT NULL
    DROP TABLE XYZ
    GO
    CREATE TABLE XYZ
    id int identity(1,1),
    ST smalldatetime NOT NULL,
    ET smalldatetime NOT NULL
    GO
    INSERT INTO XYZ (ST, ET)
    VALUES ('2010-01-01 9:00AM', '2010-01-01 10:00AM')
    INSERT INTO XYZ (ST, ET)
    VALUES ('2010-01-01 9:00AM', '2010-01-01 12:00PM')
    INSERT INTO XYZ (ST, ET)
    VALUES ('2010-01-01 1:00PM', '2010-01-01 2:00PM')
    INSERT INTO XYZ (ST, ET)
    VALUES ('2010-01-01 3:00PM', '2010-01-01 5:00PM')
    INSERT INTO XYZ (ST, ET)
    VALUES ('2010-01-01 11:00AM', '2010-01-01 12:00PM')
    GO
    WITH Gaps(Gap) AS
    SELECT COALESCE(SUM(DATEDIFF(MINUTE,ST,ET)), 0)
    FROM (
    SELECT MAX(P1.ET) AS ST, P2.ST AS ET
    FROM XYZ AS P1
    INNER JOIN XYZ AS P2 ON (P1.ST < P2.ST)
    GROUP BY P2.ST
    HAVING MAX(P1.ET) < P2.ST
    ) gaps
    SELECT (
    COALESCE(DATEDIFF(MINUTE, MIN(ST), MAX(ET)), 0)
    - (SELECT Gap FROM Gaps)
    ) / 60.0 TotalHrs
    FROM XYZ

    SELECT MAX(P1.ET) AS ST, P2.ST AS ET
    FROM XYZ AS P1
    INNER JOIN XYZ AS P2 ON (P1.ST < P2.ST)
    GROUP BY P2.ST
    HAVING MAX(P1.ET) < P2.ST
    Finds all of the gaps (that is time that is not in any interval in your original data.  To see how it works, let's look at an example.  I'm going to use data that is a little different than your original data because your data has no gaps. 
    The query still works if you have no gaps, but it is easier to see what it is doing if the data has some gaps.  Also, I'm going to explicitly set the id column instead of making it an identity.  This will make it a little easier to identify each
    row in the following explanation. So the data I'm going to work with is
    CREATE TABLE XYZ
    id int,
    ST smalldatetime NOT NULL,
    ET smalldatetime NOT NULL
    GO
    INSERT INTO XYZ (id, ST, ET)
    VALUES (1, '2010-01-01 9:00AM', '2010-01-01 10:00AM')
    INSERT INTO XYZ (id, ST, ET)
    VALUES (2, '2010-01-01 9:00AM', '2010-01-01 12:00PM')
    INSERT INTO XYZ (id, ST, ET)
    VALUES (3, '2010-01-02 1:00PM', '2010-01-02 2:00PM')
    INSERT INTO XYZ (id, ST, ET)
    VALUES (4, '2010-01-03 3:00PM', '2010-01-03 5:00PM')
    INSERT INTO XYZ (id, ST, ET)
    VALUES (5, '2010-01-03 7:00PM', '2010-01-03 9:00PM')
    Notice that the gaps here are from row 2 to row 3 (12PM on the 1st to 1PM on the 2nd) and row 3 to row 4 (2PM on the 2nd to 3PM on the 3rd) and row 4 to row 5 (5PM on the 3rd to 7PM on the 3rd).  So that's what the above subquery should be finding for
    us.
    To see what a query you don't understand is doing, simplify it to the smallest part you can and see what it returns and then build it up to the final query.  So the simplest thing we can do is just the from clause.  That gives us
    SELECT *
    FROM XYZ AS P1
    INNER JOIN XYZ AS P2 ON (P1.ST < P2.ST)
    /* That gives us the result
    1 2010-01-01 09:00:00 2010-01-01 10:00:00 3 2010-01-02 13:00:00 2010-01-02 14:00:00
    2 2010-01-01 09:00:00 2010-01-01 12:00:00 3 2010-01-02 13:00:00 2010-01-02 14:00:00
    1 2010-01-01 09:00:00 2010-01-01 10:00:00 4 2010-01-03 15:00:00 2010-01-03 17:00:00
    2 2010-01-01 09:00:00 2010-01-01 12:00:00 4 2010-01-03 15:00:00 2010-01-03 17:00:00
    3 2010-01-02 13:00:00 2010-01-02 14:00:00 4 2010-01-03 15:00:00 2010-01-03 17:00:00
    1 2010-01-01 09:00:00 2010-01-01 10:00:00 5 2010-01-03 19:00:00 2010-01-03 21:00:00
    2 2010-01-01 09:00:00 2010-01-01 12:00:00 5 2010-01-03 19:00:00 2010-01-03 21:00:00
    3 2010-01-02 13:00:00 2010-01-02 14:00:00 5 2010-01-03 19:00:00 2010-01-03 21:00:00
    4 2010-01-03 15:00:00 2010-01-03 17:00:00 5 2010-01-03 19:00:00 2010-01-03 21:00:00
    Now we want to Group by P2.ST and get the MAX(P1.ET) and P2.ST, so that gives us
    SELECT MAX(P1.ET) AS ST, P2.ST AS ET
    FROM XYZ AS P1
    INNER JOIN XYZ AS P2 ON (P1.ST < P2.ST)
    GROUP BY P2.ST
    /* Result is
    2010-01-01 12:00:00 2010-01-02 13:00:00
    2010-01-02 14:00:00 2010-01-03 15:00:00
    2010-01-03 17:00:00 2010-01-03 19:00:00
    Now with this sample data there are no rows in the output with MAX(P1.ET) > P2.ST.  But if there was one, you would not want that row because it is not a real gap (obviously, a gap can't start today and end yesterday).  (If you want to see how
    you could get a case like that, add a row 6 to the sample data with a ST of 2010-01-01 7:00PM and an ET of 2010-01-03 9:00PM.)
    So we add a HAVING MAX(P1.ET) < P2.ST to remove those cases.
    That leaves us with all of the gaps.  So then with
    SELECT COALESCE(SUM(DATEDIFF(MINUTE,ST,ET)), 0)
    FROM (
    SELECT MAX(P1.ET) AS ST, P2.ST AS ET
    FROM XYZ AS P1
    INNER JOIN XYZ AS P2 ON (P1.ST < P2.ST)
    GROUP BY P2.ST
    HAVING MAX(P1.ET) < P2.ST
    ) gaps
    we get the total amount of time in all gaps.  Then the final result is just the time from the earliest ST to the latest ET minus the total time from the gap.
    Tom

  • Please explain what are the various procedures to find user-eixts

    Hi,
    Please explain what are the various procedures to find user-eixts ?
    Ramana

    Hi,
    1. By executing this Program.
    *& Report  ZFIND_EXIT
    REPORT  ZFIND_EXIT.
    *report zbadi_find .
    tables : tstc,
    tadir,
    modsapt,
    modact,
    trdir,
    tfdir,
    enlfdir,
    sxs_attrt ,
    tstct.
    data : jtab like tadir occurs 0 with header line.
    data : field1(30).
    data : v_devclass like tadir-devclass.
    parameters : p_tcode like tstc-tcode,
    p_pgmna like tstc-pgmna .
    data wa_tadir type tadir.
    start-of-selection.
    if not p_tcode is initial.
    select single * from tstc where tcode eq p_tcode.
    elseif not p_pgmna is initial.
    tstc-pgmna = p_pgmna.
    endif.
    if sy-subrc eq 0.
    select single * from tadir
    where pgmid = 'R3TR'
    and object = 'PROG'
    and obj_name = tstc-pgmna.
    move : tadir-devclass to v_devclass.
    if sy-subrc ne 0.
    select single * from trdir
    where name = tstc-pgmna.
    if trdir-subc eq 'F'.
    select single * from tfdir
    where pname = tstc-pgmna.
    select single * from enlfdir
    where funcname = tfdir-funcname.
    select single * from tadir
    where pgmid = 'R3TR'
    and object = 'FUGR'
    and obj_name eq enlfdir-area.
    move : tadir-devclass to v_devclass.
    endif.
    endif.
    select * from tadir into table jtab
    where pgmid = 'R3TR'
    and object in ('SMOD', 'SXSD')
    and devclass = v_devclass.
    select single * from tstct
    where sprsl eq sy-langu
    and tcode eq p_tcode.
    format color col_positive intensified off.
    write:/(19) 'Transaction Code - ',
    20(20) p_tcode,
    45(50) tstct-ttext.
    skip.
    if not jtab[] is initial.
    write:/(105) sy-uline.
    format color col_heading intensified on.
    Sorting the internal Table
    sort jtab by object.
    data : wf_txt(60) type c,
    wf_smod type i ,
    wf_badi type i ,
    wf_object2(30) type c.
    clear : wf_smod, wf_badi , wf_object2.
    Get the total SMOD.
    loop at jtab into wa_tadir.
    at first.
    format color col_heading intensified on.
    write:/1 sy-vline,
    2 'Enhancement/ Business Add-in',
    41 sy-vline ,
    42 'Description',
    105 sy-vline.
    write:/(105) sy-uline.
    endat.
    clear wf_txt.
    at new object.
    if wa_tadir-object = 'SMOD'.
    wf_object2 = 'Enhancement' .
    elseif wa_tadir-object = 'SXSD'.
    wf_object2 = ' Business Add-in'.
    endif.
    format color col_group intensified on.
    write:/1 sy-vline,
    2 wf_object2,
    105 sy-vline.
    endat.
    case wa_tadir-object.
    when 'SMOD'.
    wf_smod = wf_smod + 1.
    select single modtext into wf_txt
    from modsapt
    where sprsl = sy-langu
    and name = wa_tadir-obj_name.
    format color col_normal intensified off.
    when 'SXSD'.
    For BADis
    wf_badi = wf_badi + 1 .
    select single text into wf_txt
    from sxs_attrt
    where sprsl = sy-langu
    and exit_name = wa_tadir-obj_name.
    format color col_normal intensified on.
    endcase.
    write:/1 sy-vline,
    2 wa_tadir-obj_name hotspot on,
    41 sy-vline ,
    42 wf_txt,
    105 sy-vline.
    at end of object.
    write : /(105) sy-uline.
    endat.
    endloop.
    write:/(105) sy-uline.
    skip.
    format color col_total intensified on.
    write:/ 'No.of Exits:' , wf_smod.
    write:/ 'No.of BADis:' , wf_badi.
    else.
    format color col_negative intensified on.
    write:/(105) 'No userexits or BADis exist'.
    endif.
    else.
    format color col_negative intensified on.
    write:/(105) 'Transaction does not exist'.
    endif.
    at line-selection.
    data : wf_object type tadir-object.
    clear wf_object.
    get cursor field field1.
    check field1(8) eq 'WA_TADIR'.
    read table jtab with key obj_name = sy-lisel+1(20).
    move jtab-object to wf_object.
    case wf_object.
    when 'SMOD'.
    set parameter id 'MON' field sy-lisel+1(10).
    call transaction 'SMOD' and skip first screen.
    when 'SXSD'.
    set parameter id 'EXN' field sy-lisel+1(20).
    call transaction 'SE18' and skip first screen.
    endcase.
    2. . Go to the screen>System>Status-->Program (Double
    click this program. It will take you to the program.
    2. Now, Goto-->Object Directory Entry.
    3. Make a note the package name.
    4. Now run the transactions SMOD, press F4 and enter the
    above noted package, press enter.
    5. It will display list of Exits.
    6. Now go back to the initial screen SMOD.
    7. Specify the exit name here and select the radio button
    Components.
    8. It will display four group boxes one for FM, second
    for Fcodes, thrid for Screen areas and last for
    includes.
    9. Goto transaction CMOD, create a new project, and
    click the button "Enhancement assignments" and
    specify your enhancements that you got in SMOD.
    10. Now bouble clikc the enhancement, it will take you to editor with some includes starting with Z, double clikc the include you want to edit and proceed.
    3. 1. in se11, goto table MODSAP
    View table contents
    in Type field, enter
    'E' (for user exit / Function Exit)
    OR 'S' (for screen exit)
    4. Calling Customer- fucntion in Main Program
    Thanks,
    Anitha

Maybe you are looking for