internal tables

Former Member — Thu, 14 Jun 2007 08:50:39 GMT

what is the difference between standard and sorted

internal tables? (in performance wise)

Re: internal tables

Former Member — Thu, 14 Jun 2007 09:07:08 GMT

good

Sorted table improve the performance in case of a huge table which has no: of records

thanks

mrutyun^

Re: internal tables

Former Member — Thu, 14 Jun 2007 09:18:57 GMT

In sorted table, you can use binary search function.

That means you can get very good performance.

Re: internal tables

former_member378318 — Thu, 14 Jun 2007 09:19:33 GMT

Why not try finding the answer for yourself using SAP help and SDN search???

Re: internal tables

Former Member — Thu, 14 Jun 2007 09:20:20 GMT

Hi,

Standard Tables:

Standard tables have a linear index. You can access them using either the index or the key. If you use the key, the response time is in linear relationship to the number of table entries. The key of a standard table is always non-unique, and you may not include any specification for the uniqueness in the table definition.

This table type is particularly appropriate if you want to address individual table entries using the index. This is the quickest way to access table entries. To fill a standard table, append lines using the (APPEND) statement. You should read, modify and delete lines by referring to the index (INDEX option with the relevant ABAP command). The response time for accessing a standard table is in linear relation to the number of table entries. If you need to use key access, standard tables are appropriate if you can fill and process the table in separate steps. For example, you can fill a standard table by appending records and then sort it. If you then use key access with the binary search option (BINARY), the response time is in logarithmic relation to

the number of table entries.

Sorted Tables:

Sorted tables are always saved correctly sorted by key. They also have a linear key, and, like standard tables, you can access them using either the table index or the key. When you use the key, the response time is in logarithmic relationship to the number of table entries, since the system uses a binary search. The key of a sorted table can be either unique, or non-unique, and you must specify either UNIQUE or NON-UNIQUE in the table definition. Standard tables and sorted tables both belong to the generic group index tables.

This table type is particularly suitable if you want the table to be sorted while you are still adding entries to it. You fill the table using the (INSERT) statement, according to the sort sequence defined in the table key. Table entries that do not fit are recognised before they are inserted. The response time for access using the key is in logarithmic relation to the number of

table entries, since the system automatically uses a binary search. Sorted tables are appropriate for partially sequential processing in a LOOP, as long as the WHERE condition contains the beginning of the table key.

Regards,

Priyanka.

Re: internal tables

Former Member — Fri, 15 Jun 2007 10:26:59 GMT

To all gurus helping me out. As iam new to this field.

Thanks&Regards

Suri

topic Re: internal tables in Application Development and Automation Discussions

internal tables

Re: internal tables

Re: internal tables

Re: internal tables

Re: internal tables

Re: internal tables