(1) The arrangement of memory records.
(2) A table of information that is accessed by way of a shortened search key (the hash value). The use of a hash table minimises average search time.
(3) A data structure that divides all elements into (preferably) equal-sized categories, or buckets, to allow quick access to the elements. The hash function determines which bucket an element belongs in.