Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.12008/3481
How to cite
| Title: | On Worst Case Robin-Hood Hashing |
| Authors: | Devroye, Luc Morin, Pat Viola, Alfredo |
| Type: | Reporte técnico |
| Keywords: | OPEN ADRESSING, HASHING, ROBIN HOOD, WORST-CASE SEARCH TIME, COLLISION RESOLUTION, PROBABILISTIC ANALYSIS OF ALGORITHMS |
| Issue Date: | 2002 |
| 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 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. |
| Publisher: | UR. FI – INCO. |
| Series or collection: | Reportes Técnicos 02-12 |
| ISSN: | 0797-6410 |
| Citation: | DEVROYE, L., MORIN, P., VIOLA, A. "On Worst Case Robin-Hood Hashing". Reportes Técnicos 02-12. UR. FI – INCO, 2002. |
| License: | Licencia Creative Commons Atribución – No Comercial – Sin Derivadas (CC BY-NC-ND 4.0) |
| Appears in Collections: | Reportes Técnicos - Instituto de Computación |
Files in This Item:
| File | Description | Size | Format | ||
|---|---|---|---|---|---|
| TR0212.pdf | 168,68 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License
