This document discusses hash algorithms which are used for distributed memory management. Hash algorithms calculate the memory position of an entry based on a unique key, as the data in distributed memory is not stored in order. The memory position is calculated using the hash algorithm on the key.
This document discusses hash algorithms which are used for distributed memory management. Hash algorithms calculate the memory position of an entry based on a unique key, as the data in distributed memory is not stored in order. The memory position is calculated using the hash algorithm on the key.
This document discusses hash algorithms which are used for distributed memory management. Hash algorithms calculate the memory position of an entry based on a unique key, as the data in distributed memory is not stored in order. The memory position is calculated using the hash algorithm on the key.
This document discusses hash algorithms which are used for distributed memory management. Hash algorithms calculate the memory position of an entry based on a unique key, as the data in distributed memory is not stored in order. The memory position is calculated using the hash algorithm on the key.
SAP NetWeaver AS ABAP Rel ease 702, Copyri ght 2010 SAP AG. Al l ri ghts reserved.
ABAP Keyword Documentation ABAP Glossary
Hash algorithm Distributed memory management. The data in a distributed memory is not stored in order in the memory. The memory position of an entry is calculated using the hash algorithm on the basis of a unique key. More