On Worst Case Robin-Hood Hashing

On Worst Case Robin-Hood Hashing (2004)

by Luc Devroye , Pat Morin , Alfredo Viola

Venue:

SIAM J. Computing

User correction supplied by mph

Datum	Value	Source
TITLE	On Worst Case Robin-Hood Hashing	user correction
AUTHOR NAME	Luc Devroye	user correction
AUTHOR NAME	Pat Morin	user correction
AUTHOR NAME	Alfredo Viola	user correction
ABSTRACT	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 farthest can stay in the slot. We hash ∼ αn 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 ∈ [log 2 log n + σ, log 2 log n + τ] for some constants σ, τ depending upon α only. This 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.	user correction
YEAR	2004	user correction
VENUE	SIAM J. Computing	user correction
VOLUME	33	user correction
NUMBER	4	user correction
CITATIONS	24 found	ParsCit 1.0