Date of this Version
SIAM Journal on Computing
Hashing with lazy deletion is a simple method for maintaining a dynamic dictionary: items are inserted and sought as usual in a separate-chaining hash table; however, items that no longer need to be in the data structure remain until a later insertion operation stumbles on them and removes them from the table. Because hashing with lazy deletion does not delete items as soon as possible, it keeps more items in the dictionary than methods that use more careful deletion strategies. On the other hand, its space overhead is much smaller than those more careful methods, so if the number of extra items is not too large, hashing with lazy deletion can be a practical algorithm when space is scarce. In this paper, we analyze the expected amount of excess space used by hashing with lazy deletion.
Copyright © by SIAM. Unauthorized reproduction of this article is prohibited.
dynamic dictionary, first passage times, storage
Morrison, J. A., Shepp, L. A., & Van Wyk, C. J. (1987). A Queueing Analysis of Hashing With Lazy Deletion. SIAM Journal on Computing, 16 (6), 1155-1164. http://dx.doi.org/10.1137/0216073
Date Posted: 27 November 2017
This document has been peer reviewed.