Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,674,171 papers from all fields of science
Search
Sign In
Create Free Account
Lazy deletion
Known as:
Eager delete
, Eager deletion
, Lazy delete
In computer science, lazy deletion refers to a method of deleting elements from a hash table that uses open addressing. In this method, deletions are…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Computer science
Dynamic perfect hashing
Hash table
Linear probing
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Low-Profile Source-side Deduplication for Virtual Machine Backup
Daniel Agun
,
Tao Yang
,
Wei Zhang
USENIX Workshop on Hot Topics in Cloud Computing
2016
Corpus ID: 6626782
This paper presents a source-side backup scheme with low-resource usage through collaborative deduplication and approximated lazy…
Expand
2013
2013
Maximum Size of a Dynamic Data Structure : Hashing with Lazy Delection Revisited
David Aldous
,
M. Hofri
,
W. Szpankowski
2013
Corpus ID: 267901117
Wojciech Szpankowskit Dept. of Computer Science Purdue University W. Lafayette, IN 47907 U.S.A. We study the dynamic data…
Expand