Deletion Algorithms for Coalesced Hashing.
Journal
Comput. J.
Journal Volume
29
Journal Issue
5
Pages
436-450
Date Issued
1986
Author(s)
Vitter, Jeffrey Scott
Abstract
We present efficient deletion algorithms for three variants of coalesced chaining – late insertion (LICH), early insertion (EICH), and varied insertion (VICH). Our approach is uniform in the sense that each deletion algorithm works simultaneously for all three variants, though the implementation details are of course different. Deletion algorithms for coalesced hashing when there is a cellar have not been studied previously in the literature; these algorithms are useful because coalesced hashing is most efficient when a cellar is utilised.
SDGs
Type
journal article