topic Re: Query on Read table.... in Application Development and Automation Discussions

Query on Read table....

Former Member — Thu, 07 Feb 2008 13:15:54 GMT

Hi All,

I am new to ABAP. I want to know wherether it is better to fire a READ TABLE based on key or index.

Which one would be faster ?

thanks in advance,

Ashish

Former Member — Thu, 07 Feb 2008 13:27:39 GMT

Index will be faster to start with,

but if you use BINARY SEARCH addition when you use KEY, then the serach speed will increase considerably.

to use BINARY SEARCH addition in READ statement, the internal table must be sort by the key you are using to search.

Regards,

Ravi Kanth Talagana

Former Member — Thu, 07 Feb 2008 15:57:49 GMT

An INDEXed READ will be faster than a BINARY SEARCH.

Rob

Former Member — Thu, 07 Feb 2008 21:19:56 GMT

Your question does not really make sense, reading with key or index are not equal

options. Usually you will know the key, but rarely the index! The index is only know, if you work inside a loop on the same table.

Use search blog and my last name 'boes' there is a blog with extensive runtime measurements!

Binary search splits to table into halves and reduces this until the correct line is found,

so the runtime grows logarithmically with the size of the table ( N = number of lines).

Standard tables allow binary search, sorted tables have automatically a binary search.

Index search jump directly to the wanted line, i.e independent of the table size. Also hashed

reads work like that.

Siegfried

Former Member — Fri, 08 Feb 2008 04:57:58 GMT

Hi All,

Thanks for your suggestions !!!

Best Regards,

Ashish