differences between the sorted ,standard, hashed tables.
Answer Posted / ektagalani
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.
| Is This Answer Correct ? | 22 Yes | 4 No |
Post New Answer View All Answers
Are you familiar with all steps for setting up a workflow?
What are the differences between structure and table in data dictionary in abap? : sap abap data dictionary
How can you manipulate the presentation and attributes of interactive lists?
What are the kinds of foreign key fields?
Explain the Types of Select statements?
Explain the sequences of event block?
What is the role of ‘refresh’ in internal table?
What are the events in screen programming?
What is meant by performance analysis? Have done anything to improve the performance?
Did you create primary index?
When will the current screen processing terminates?
What are the events we use in dialog programming and explain them?
What is locking? : abap data dictionary
What are your ways to performance optimization?
What are logical databases? What are the advantages of logical databases?