The Internal table type are:
a) The standard table: for key access to this type of table linear search is used, so the duration needed for a search has a linear connection to how many table entries we have. For accessing standard tables it is best to use index operations.
b) The hashed table: it is a table that will be handled using an internal hash procedure and it will only be available to access with the generic (key) operations like LOOP, SORT and others, so implicit/explicit index operations are forbidden.
c) The sorted table: it is a table that is every time sorted in the right way and to access it we need to use binary keys. The index from the lower level is picked up by the system if we don’t have a unique key. The table count determines directly in a logarithmic way the needed runtime for key access.
d) The index table: is the table which is possible for us to access with the aid of an index. Its solely purpose if to say what kind of generic parameters we will have in a function or form.
a) The standard table: for key access to this type of table linear search is used, so the duration needed for a search has a linear connection to how many table entries we have. For accessing standard tables it is best to use index operations.
b) The hashed table: it is a table that will be handled using an internal hash procedure and it will only be available to access with the generic (key) operations like LOOP, SORT and others, so implicit/explicit index operations are forbidden.
c) The sorted table: it is a table that is every time sorted in the right way and to access it we need to use binary keys. The index from the lower level is picked up by the system if we don’t have a unique key. The table count determines directly in a logarithmic way the needed runtime for key access.
d) The index table: is the table which is possible for us to access with the aid of an index. Its solely purpose if to say what kind of generic parameters we will have in a function or form.