e/Linear hashing

Information
has gloss	eng: 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. The frequent single slot expansion can very effectively control the length of the collision chain. The cost of hash table expansion is spread out across each hash table insertion operation, as opposed to be incurred all at once. Therefore linear hashing is well suited for interactive applications.
lexicalization	eng: linear hashing
instance of	e/Search algorithm