Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On deletions in open addressing hashing

Autor
Jimenez, R.; Martinez, C.
Tipus d'activitat
Document cientificotècnic
Data
2011
Codi
LSI-11-11-R
Repositori
http://hdl.handle.net/2117/91265 Obrir en finestra nova
Resum
Deletions in open addressing tables have often been seen as problematic. The usual solution is to use a special mark ’deleted’ so that probe sequences continue past deleted slots, as if there was an element still sitting there. Such a solution, notwithstanding is wide applicability, may involve serious performance degradation. In the first part of this paper we review a practical implementation of the often overlooked deletion algorithm for linear probing hash tables, analyze its properties ...
Citació
Jiménez, R., Martínez, C. "On deletions in open addressing hashing". 2011.
Paraules clau
Analysis of algorithms, Deletions, Hashing, Linear probing, Open addressing
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius