A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
On Deletions in Open Addressing Hashing
[chapter]
2018
2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
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 and
doi:10.1137/1.9781611975062.3
dblp:conf/analco/JimenezM18
fatcat:ozptpgqwlndfllpgohxmfu5zzi