VijayaBhaskar Thammineni

• Mar 15th, 2005

 

Types of internal tablesSTANDARD table Key access to a standard table uses a linear search. This means that the time required for a search is in linear relation to the number of table entries. You should use index operations to access standard tables. 2 SORTED tableDefines the table as one that is always saved correctly sorted. Key access to a sorted table uses a binary key. If the key is not unique, the system takes the entry with the lowest index. The runtime required for key access is logarithmically related to the number of table entries. 3 HASHED tableDefines the table as one that is managed with an internal hash procedureYou can only access a hashed table using the generic key operations or other generic operations ( SORT, LOOP, and so on). Explicit or implicit index operations (such as LOOP ... FROM oe INSERT itab within a LOOP) are not allowed. 4 INDEX tableA table that can be accessed using an index.Index table is only used to specify the type of generic parameters in a FORM or FUNCTION. That means that you can't create a table of type INDEX.Standard tables and sorted tables are index tables.5 ANY tableAny table is only used to specify the type of generic parameters in a FORM or FUNCTION. That means that you can't create a table of type ANY.Standard, sorted and hashed tables belongs to ANY tables.Regardsvijay

Vamsee

• Sep 13th, 2005

 

There are three types of Internal Tables exist.

 

1.Standard Internal Tables: These tables have a linear index and can be accessed using the index or the key. The response time is in linear relationship with number of table entries. These tables are useful when user wants to address individual table entries using the index.

2.Sorted Internal Tables: These tables also have an index and the key. But, the response time is in logarithmic relationship with number of table entries, since it uses binary search algorithm instead of linear search. These tables are useful when user wants the table to be sorted while additional entries have to be added.

3.Hashed Internal Tables: These tables have no index, but have the key. The response time is constant irrespective of number of table entries, since it uses a Hash algorithm. These tables are useful when user wants to access the entries with key only.

Arun R

• Oct 5th, 2005

 

Internal tables can be classified as 1) Standard Table2) Sorted Table3) Hashed Tables

gurmeet

• May 30th, 2006

 

Internal tabes can be classified as :

1.Standard

2.Sorted

3.Hashed

Also, Generic Table Types Are

1.Index

2.Any

vsnl

• Oct 6th, 2006

 

There are four types of internal tables,they are:

1.standard

2.structured

3.sorted

4.hashed

Madhu

• Apr 26th, 2007

 

There are only two type of Internal Table classification and 3 type of itabs.
1) Indexed  -- a) Standard  b) Sorted.
2) Hashed -- a) Hashed tables.

This is the correct classification.

yugandhar

• Sep 12th, 2011

 

standard internal tables: these tables have linear index and can be accessed using the index or key.the responce time is in linear relationship with number of table entries.these tables are useful when user wants to address individual table entries using the index
sorted internal tables: these tables also have an index and key,but the responce time is in logarithmic relationship with number of table entries .since it uses binary search algorithm instead of linear search.these tables are useful when user wants the table to be sorted which additions .entries have to be addes