Hashing

Some articles on hashing:

SUHA (computer Science) - Applications
... Minimizing hashing collisions can be achieved with a uniform hashing function ... Assuming uniform hashing allows hash table analysis to be made without exact knowledge of the input or the hash function used ...
Linear Hashing
... Linear hashing is a dynamic hash table algorithm invented by Witold Litwin (1980), and later popularized by Paul Larson ... Linear hashing allows for the expansion of the hash table one slot at a time ... Linear hashing is therefore well suited for interactive applications ...
Locality-sensitive Hashing
... Locality-sensitive hashing (LSH) is a method of performing probabilistic dimension reduction of high-dimensional data ... Note how locality-sensitive hashing, in many ways, mirrors data clustering ...
Consistent Hashing
... Consistent hashing is a special kind of hashing ... When a hash table is resized and consistent hashing is used, only keys need to be remapped on average, where is the number of keys, and is the number of slots ...
Bitstate Hashing
... Bitstate hashing is a hashing method invented in 1968 by Morris ... It is used for state hashing, where each state (e.g ... is losing precision like in other hashing techniques ...