Algorithmica

, Volume 1, Issue 1, pp 17–29

The complexity of hashing with lazy deletion

  • Christopher J. Van Wyk
  • Jeffrey Scott Vitter
Article

DOI: 10.1007/BF01840434

Cite this article as:
Van Wyk, C.J. & Vitter, J.S. Algorithmica (1986) 1: 17. doi:10.1007/BF01840434

Abstract

We examine a version of the dynamic dictionary problem in which stored items have expiration times and can be removed from the dictionary once they have expired. We show that under several reasonable assumptions about the distribution of the items, hashing with lazy deletion uses little more space than methods that use eager deletion. The simple algorithm suggested by this observation was used in a program for analyzing integrated circuit artwork.

Key words

Hashing algorithmsComplexityLazy deletion strategiesBirth-death processLaplace's method

Copyright information

© Springer-Verlag New York Inc. 1986

Authors and Affiliations

  • Christopher J. Van Wyk
    • 1
  • Jeffrey Scott Vitter
    • 2
  1. 1.AT & T Bell LaboratoriesMurray HillUSA
  2. 2.Department of Computer ScienceBrown UniversityProvidenceUSA