On Worst Case Robin-Hood Hashing
Resumen:
We consider open addressing hashing, and implement it by using the Robin Hood strategy, that is, in case of collision, the element that has traveled the furthest can stay in the slot. We hash elements into a table of size n where each probe is independent and uniformly distributed over the table, and [ 1 is a constant. Let Mn be the maximum search time for any of the elements in the table. We show that with probability tending to one, Mn E [kig2 logn + s, log2 logn + T] for some constants s, T depending upon alfa only. Tis is an exponential improvement over the maximum search time in case of the standard FCFS (first come first served) collision strategy, and virtually matches the performance of multiple choice hash methods.
| 2002 | |
|
OPEN ADRESSING HASHING ROBIN HOOD WORST-CASE SEARCH TIME COLLISION RESOLUTION PROBABILISTIC ANALYSIS OF ALGORITHMS |
|
| Universidad de la República | |
| COLIBRI | |
| http://hdl.handle.net/20.500.12008/3481 | |
| Acceso abierto | |
| Licencia Creative Commons Atribución – No Comercial – Sin Derivadas (CC BY-NC-ND 4.0) |
| Sumario: | We consider open addressing hashing, and implement it by using the Robin Hood strategy, that is, in case of collision, the element that has traveled the furthest can stay in the slot. We hash elements into a table of size n where each probe is independent and uniformly distributed over the table, and [ 1 is a constant. Let Mn be the maximum search time for any of the elements in the table. We show that with probability tending to one, Mn E [kig2 logn + s, log2 logn + T] for some constants s, T depending upon alfa only. Tis is an exponential improvement over the maximum search time in case of the standard FCFS (first come first served) collision strategy, and virtually matches the performance of multiple choice hash methods. |
|---|
