‎2008 Jun 25 1:21 PM
Hi,
READ staments in ABAP use a hash algorithm to search information in a hashed internal table, and the runtime is independent of the number of table entries.
So, Who does hash algorithm work?
Thanks.
‎2008 Jun 25 1:23 PM
hi,
The hash algorithm is built up by the system automatically. You don't have to care about that, you just have to define the internal table TYPE HASHED.
hope this helps
ec
‎2008 Jun 25 2:33 PM
read about hash functions in wikipedia or something similar, these are special functions.
A hash function can calculate from the key the address (line number) where the record is stored. Every insert changes the function a bit, access is like an index access only slightly slower as the calculation takes also time, we are talking of some microseconds.
You need to know the complete key, otherwise iit will noot work at all, and the read will scan the full table.
Siegfried
‎2008 Jun 25 2:49 PM