Scribd
Upload
181 views

Parallel Cursor Method

The document discusses improving the performance of ABAP programs that process large amounts of data by using a parallel cursor method rather than a sequential method. It explains that the parallel cursor method sorts header and item tables by key and uses indexing to efficiently loop through matching records, while the sequential method loops header records and searches the item table on each iteration. An example compares the runtime of programs using each method on sample data.

Uploaded by

Jayraj08
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
181 views

Parallel Cursor Method

The document discusses improving the performance of ABAP programs that process large amounts of data by using a parallel cursor method rather than a sequential method. It explains that the parallel cursor method sorts header and item tables by key and uses indexing to efficiently loop through matching records, while the sequential method loops header records and searches the item table on each iteration. An example compares the runtime of programs using each method on sample data.

Uploaded by

Jayraj08
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

A program with the right functionality and smartly written, but with poor performance will not satisfy

the client requirements. Business programs usually handle huge amounts of data. ABAP programs in SAP implementations are not an exception to this, and they need to give the user acceptable response times before they can be delivered to the client. Therefore, every developer should pay special attention to performance when building programs. Although too many times the development environment will not have an adequate data volume (and nearly always not as in real productive systems), there is always a lot that can be done to deliver good programs from a performance standpoint. Database accesses are probably the first focus point; wrong sentences searching records in tables may lead to extremely poor response times, and this needs to be taken care of. However, there is another important area to bear in mind, which is forgotten more often that it could be thought: data processing within the program. This white paper, oriented to developers and technical designers, will explain an amazing alternative way of processing data (applicable when handling together header and position records) that will give great response times, making it possible to build complex programs that need to process big amounts of data in an acceptable time and achieving customer satisfaction.

Parallel Cursor Method


Performance is a very important point in program building. ABAP include, with each new version released, improved sentences for data base accessing, new kinds of internal tables everything dedicated to get a better performance in the code built. There is a lot of investigation to be done as it is a complex and extremely wide area. Although it is not always easy to have an adequate development environment to carry out acceptable volume test (as in real productive systems) that would help identify performance issues in the programs, there are some tools in the SAP Workbench that can be used to optimize the programs that are going to be delivered, mainly focused on database accessing. It is very important to analyze the SQL sentences to ensure the ones being used are the right ones. SAP provides with two powerful tools, such as the Runtime analysis (SE30) and the SQL Trace (ST05). They show how open SQL statements are converted into native SQL statements, measure database accesses and help to improve program performance. The correct use of the FOR ALL ENTRIES clause, the optimization in the selection of fields on SELECT clause and in the WHERE clause restriction, the use of indexes when accessing data These are some of the important points that have to be taken into account. However, the ABAP program will handle and process the data after it is retrieved from the database. This is an important area that should not be forgotten when optimizing programs performance. This will explains the parallel cursor method (PCM), a method that can be used to improve the programs performance in this second important point, when handling header and position records together. This is explained with a real life example, comparing the results obtained with two different versions of source code, one with the traditional data handling and one applying the method. The white paper also gives

technical instructions to apply the method in the special case when the tables have a different key.

Sequential Method
Get the starting Run time. Loop the header internal table. Inside the master loop, item data will be looped and if any item data found, both the header and item data will be moved to another internal table. Get the Ending Run Time. The difference in End and Start run time is the actual time taken for sequential search.
SORT <Header Internal Table> BY <Key Field> ASCENDING. SORT <Item Internal Table> BY <Key Field> <Key Field> ASCENDING. CLEAR: <Header Work Area>. GET RUN TIME FIELD <Begin Time> LOOP AT <Header Internal Table> INTO <Header Work Area>. CLEAR: <Item Work Area>. LOOP AT <Item Internal Table> INTO <Item Work Area>. WHERE <Key Field> EQ <Header KEY Field>. PROCESS the Header AND Item DATA. ENDLOOP. ENDLOOP. GET RUN TIME FIELD <End Time> Total TIME = End TIME Begin TIME.

Parallel Method
Sort the header and item internal table. Get the starting Run time. Loop the header internal table. Inside the master loop, Item data will be looped by checking the index. If the key field of item data is greater than the key field of header data, then there is no item data is found and exit from the detail loop. If item data is equal to the key field of header data, move the header and item data to another internal table. Store the index of the item data. And continue the process. Get the Ending Run Time. The difference in End and Start run time is the actual time taken for Parallel Cursor.
SORT <Header Internal Table> BY <Key Field> ASCENDING. SORT <Item Internal Table> BY <Key Field> <Key Field> ASCENDING. CLEAR: <Header Work Area>. INITIALIZE INDEX Variable GET RUN TIME FIELD <Begin Time> LOOP AT <Item Internal Table> INTO <Item Work Area>. CLEAR: <Header Work Area>. LOOP AT <Header Internal Table> INTO <Item Work Area>. FROM <Index Number> IF <Item KEY Field> Greater Than <Header KEY Field> NO DATA found IN the item INTERNAL TABLE. EXIT. ELSE <Item KEY Field> Equal TO <Header KEY Field>

variable.

Store the INDEX OF the item INTERNAL TABLE INTO a

PROCESS the Header AND Item DATA. ENDIF. ENDLOOP. ENDLOOP. GET RUN TIME FIELD <End Time> Total TIME = End TIME Begin TIME.

You might also like