Browse Prior Art Database

HIGH SPEED Technique to ACCELERATE/OPTIMIZEprocessing of INTERNAL TABLES in ABAP-SAP programs

IP.com Disclosure Number: IPCOM000030466D
Original Publication Date: 2004-Aug-17
Included in the Prior Art Database: 2004-Aug-17
Document File: 6 page(s) / 282K

Publishing Venue

IBM

Abstract

Disclosed is a Programming Technique to improve dramatically way to process nested internal tables used in ABAP* codes. It replaces nested loop techniques allowing fast data processing. Hours of processing large internal tables can be reduced to just few seconds instead.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 54% of the total text.

Page 1 of 6

HIGH SPEED Technique to ACCELERATE /OPTIMIZEprocessing of INTERNAL TABLES in ABAP-SAP programs

Novel Contribution of current disclosure

    Disclosed is a Programming Technique to improve dramatically a way to process nested internal tables used in ABAP*TM codes. It replaces nested loop techniques allowing fast data processing.

Description of this concept

    Processing high volume of data is a common problem that companies face; since each day, information is created and stored, volume of databases is increased generating a problem of performance when data should be processed [read/maintain]. The most common technique in ABAP to process data extracted from tables is related with use of "Internal tables" <memory usage> since costs of processing databases tables during run-time can require excessive resources from servers and time of Database manager systems. Access to memory is faster than process to open/read/close tables from database repository...

Figure 1

Technique proposed can be implemented to replace any ABAP code using nested loops . Its core is oriented to access directly just to the records that need to be processed instead of accessing to all records to evaluate which should be processed { this is the problem with NESTED LOOPS}. This novel technique is based on recursive processing, direct read and binary search programming techniques. By accessing only the needed records, the number of accesses and processing time are extremely reduced.

Figure 2

1

[This page contains 1 picture or other non-text object]

Page 2 of 6

Initial Considerations

    Technique proposed is oriented to replace use of 'Nested Loop' for processing internal tables in ABAP programming language.

    Two tables are involved in this processing, one of them named 'Header' {Contains just header information} and the other one named 'Detail' {containing just details of each header record - items - }. Nested loops can involve several internal tables; however, most common processing involves just two.

    As it is required by nested loops, our technique proposed assumes that both tables are related by a KEY { Those fields common in both tables used to link each other }.

'Detail' table must be sorted by those fields used as KEY.

Number of records in Detail table must be known prior its processing.

How does it work?

STEP1: Is RECURSIVE technique necessary?

  In order to determine if a recursive search should be applied to DETAIL table, a BINARY SEARCH must be applied initially to find out at least one DETAIL record with a same KEY of current HEADER record. If the search is successful, it means that more sequential records with the same KEY may exist above and/or below the initial record found. If the search is unsuccessful, it means that no detail records exist for current header KEY so, in this case...