The difference between standard tables, sorted table and hashed tables are -
1. Standard Table
It has an internal linear index.
The system can access records either by using the table index or the key.
The response time for key access is proportional to the number of entries in the table.
You cannot specify a unique key. It has always non-unique key.
2. Sorted Table
Sorted table are always saved sorted by the key. They also have an internal index.
The system can access records either by using the table index or the key.
The response time for key access is logarithmically proportional 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. When you define the table, you must specify whether the key is to be UNIQUE or NON-UNIQUE.
3. Hashed Table
Hashed tables have no linear index. You can only access a hashed table using its key.
The response time is independent of the number of table entries, and is constant, since the system accesses the table entries using a hash algorithm.
The key of a hashed table must be unique.
When you define the table, you must specify the key as UNIQUE.
Serkan AKKAVAK
Computer Engineer BSc
Head of SAP & Software Department
Contact : serkurumsal@yandex.com
0 Comments