Content deleted Content added
m moved Linear hash to Linear hashing over redirect: For consistency with DADS, and because the current title is confusing, a linear hash is another name for an order-preserving hash |
No edit summary |
||
Line 2:
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. <ref> {{Citation | first1=Per-Åke | last1=Larson | title=Dynamic Hash Tables | journal=Communications of the ACM | pages=pp. 446-457 | date=April 1988 | Volume=31 | Number=4 | doi=10.1145/42404.42410 | url=http://doi.acm.org/10.1145/42404.42410}}</ref> Therefore
linear hashing is well suited for interactive applications.
| |||