Use of binary search option

When a programmer uses the read command, the table is sequentially searched. This slows down the processing. Instead of this, use the binary search addition. The binary search algorithm helps faster search of a value in an internal table. It is advisable to sort the internal table before doing a binary search. Binary search repeatedly divides the search interval in half. If the value to be searched is less than the item in the middle of the interval, the search is narrowed to the lower half, otherwise the search is narrowed to the upper half. 

Not Recommended

            Read table int_fligh with key  airln = ‘LF’.

Recommended

            Read table int_fligh with key  airln = ‘LF’ binary search.

===================================================================================

This tutorial contains a number of pages, each one explaining a tip or trick. You can either browse them one by one (click on the NEXT button, or jump straight to a tip or trick which interests you:

• Introduction

• Selection criteria

• Aggregate functions

• Views instead of base tables

• The "into table" clause

• Modifying a group of lines

• Use of binary search option

• Appending two internal tables

• Table buffering

• Use of "for all" entries

• Proper structure of "where" clause

• Proper use of "move" statement

• Proper use of "inner join"

• Use of "ABAP Sort" instead of "Order By"

• Tools for analysis of performance