Statistics Papers

Document Type

Journal Article

Date of this Version

12-1987

Publication Source

SIAM Journal on Computing

Volume

16

Issue

6

Start Page

1155

Last Page

1164

DOI

10.1137/0216073

Abstract

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/Permission Statement

Copyright © by SIAM. Unauthorized reproduction of this article is prohibited.

Keywords

dynamic dictionary, first passage times, storage

Share

COinS
 

Date Posted: 27 November 2017

This document has been peer reviewed.