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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Donald E. Knuth,Sorting and Searching, Addison-Wesley, Reading, Massachusetts (1973). Volume 3 ofThe Art of Computer Programming.
Thomas G. Szymanski and Christopher J. Van Wyk, “Space-efficient algorithms for VLSI artwork analysis,”Proc. IEEE Design Automation Conference, pp. 743–749 (June, 1983).
William Feller,An Introduction to Probability Theory and Its Applications, John Wiley & Sons, New York (third edition 1968).
Nicolaas G. de Bruijn,Asymptotic Methods in Analysis, Dover Publications, New York (1981).
Author information
Authors and Affiliations
Additional information
Communicated by C. K. Wong.
Support for this author was provided in part by NSF research grants MCS-81-05324 and DCR-84-03613, by an IBM research contract, by an IBM Faculty Development Award, and by ONR and DARPA under Contract N00014-83-K-0146 and ARPA Order No. 4786.
Rights and permissions
About this article
Cite this article
Van Wyk, C.J., Vitter, J.S. The complexity of hashing with lazy deletion. Algorithmica 1, 17–29 (1986). https://doi.org/10.1007/BF01840434
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01840434