The three type of internal table are as follows:
=> Standard table- Standard table is suitable if index is used to address the individual entries. Internal index or key is used to access it. It is filled by APPEND statement. To read and modify and delete entries, index is used with relevant ABAP command. As the number of entries increases, accessing time for it also increases in linear form.
=> Sorted table- Sorted table is suitable when there is requirement of sorted entries. INSERT statement is used to fill this table. Sort sequence which is defined through table key is used to insert the entries in sorted table. As the system uses binary search, the response time for accessing the table is proportional to the number of entries in the table.
The sorted table has either unique or non-unique key.
=> Hashed table— Hashed table is used where user wants to process a large amount of data. It is also used where user wants to use an internal table which is similar to database table. It is suitable where key accessing is a major part.
Index cannot be used to access the hash table. The response time is independent of the number of table entries and constant as hash algorithm is used to access the table entries. The hashed table must have unique key.
=> Standard table- Standard table is suitable if index is used to address the individual entries. Internal index or key is used to access it. It is filled by APPEND statement. To read and modify and delete entries, index is used with relevant ABAP command. As the number of entries increases, accessing time for it also increases in linear form.
=> Sorted table- Sorted table is suitable when there is requirement of sorted entries. INSERT statement is used to fill this table. Sort sequence which is defined through table key is used to insert the entries in sorted table. As the system uses binary search, the response time for accessing the table is proportional to the number of entries in the table.
The sorted table has either unique or non-unique key.
=> Hashed table— Hashed table is used where user wants to process a large amount of data. It is also used where user wants to use an internal table which is similar to database table. It is suitable where key accessing is a major part.
Index cannot be used to access the hash table. The response time is independent of the number of table entries and constant as hash algorithm is used to access the table entries. The hashed table must have unique key.
No comments:
Post a Comment