There are 3 different types of internal tables :
1. Standard table
2. Sorted table
3. Hashed table
Standard table :
The records of standard table are accessed by using a table index or key.
Standard tables always have a non-unique key.
A standard table can be populated by using the APPEND statement .
Sorted table :
The records of sorted table are accessed by using a table index or key.
The key is defined as either unique or non-unique.
Sorted table is populated by using INSERT statement.In sorted tables records entered are automatically sorted.
Hashed table :
These records of hashed table are accessed only by the keys (using hash algorithm) but not by indexes.
The key of a hashed table must be defined as unique.
Hashed table is populated by using INSERT statement.
Hashed tables are useful if you want to construct and use an internal table which resembles a database table or for processing large amounts of data.
Additional Info :Standard and Sorted tables are called index tables.
Index access is the quickest possible access.
1. Standard table
2. Sorted table
3. Hashed table
Standard table :
The records of standard table are accessed by using a table index or key.
Standard tables always have a non-unique key.
A standard table can be populated by using the APPEND statement .
Sorted table :
The records of sorted table are accessed by using a table index or key.
The key is defined as either unique or non-unique.
Sorted table is populated by using INSERT statement.In sorted tables records entered are automatically sorted.
Hashed table :
These records of hashed table are accessed only by the keys (using hash algorithm) but not by indexes.
The key of a hashed table must be defined as unique.
Hashed table is populated by using INSERT statement.
Hashed tables are useful if you want to construct and use an internal table which resembles a database table or for processing large amounts of data.
Additional Info :Standard and Sorted tables are called index tables.
Index access is the quickest possible access.