A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Linear Probing Revisited: Tombstones Mark the Death of Primary Clustering
[article]
2021
arXiv
pre-print
First introduced in 1954, linear probing is one of the oldest data structures in computer science, and due to its unrivaled data locality, it continues to be one of the fastest hash tables in practice. It is widely believed and taught, however, that linear probing should never be used at high load factors; this is because primary-clustering effects cause insertions at load factor 1 - 1 /x to take expected time Θ(x^2) (rather than the ideal Θ(x)). The dangers of primary clustering, first
arXiv:2107.01250v1
fatcat:d2zopxzg3zetnf5i5ubpz6oaqi