Linear Probing with Constant Independence
| dc.creator | Pagh, Anna | |
| dc.creator | Pagh, Rasmus | |
| dc.creator | Ruzic, Milan | |
| dc.date | 2006-12-08 | |
| dc.date.accessioned | 2026-07-07T07:31:52Z | |
| dc.date.available | 2026-07-07T07:31:52Z | |
| dc.description | Hashing with linear probing dates back to the 1950s, and is among the most studied algorithms. In recent years it has become one of the most important hash table organizations since it uses the cache of modern computers very well. Unfortunately, previous analysis rely either on complicated and space consuming hash functions, or on the unrealistic assumption of free access to a truly random hash function. Already Carter and Wegman, in their seminal paper on universal hashing, raised the question of extending their analysis to linear probing. However, we show in this paper that linear probing using a pairwise independent family may have expected {\em logarithmic} cost per operation. On the positive side, we show that 5-wise independence is enough to ensure constant expected time per operation. This resolves the question of finding a space and time efficient hash function that provably ensures good performance for linear probing. | |
| dc.description | 13 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0612055 | |
| dc.identifier | http://arxiv.org/abs/cs/0612055 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/118908 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | Databases | |
| dc.title | Linear Probing with Constant Independence | |
| dc.type | text |