Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Computer scienceDynamic perfect hashingHash tableLinear probing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Determination of Optimal Thread Pool for Cloud Based Concurrent Enhanced No-Escape Search
In this era of high demand for cloud-computing, concurrent and high-performance processing is the viable option to enhance… 
2016
2016
Low-Profile Source-side Deduplication for Virtual Machine Backup
This paper presents a source-side backup scheme with low-resource usage through collaborative deduplication and approximated lazy… 
2015
2015
Performance impact of lazy deletion in metric trees for incremental clone analysis
Doing clone detection in multiple versions of a software can be expensive. Incremental clone detection is acknowledged to be a… 
2013
2013
Maximum Size of a Dynamic Data Structure : Hashing with Lazy Delection Revisited
Wojciech Szpankowskit Dept. of Computer Science Purdue University W. Lafayette, IN 47907 U.S.A. We study the dynamic data… 
2013
2013
Logical Data Deletion in High-Performance De-Duplication Backup
Data de-duplication divides backup stream into chunks and eliminates duplicate chunks across the entire system, thus remarkably… 
2008
2008
An Efficiently Updating Index Structure on Road Network
In this paper,we propose a new disk-based index structure for moving object on road network,called network-based lazy update R… 
2006
2006
Data structures with dynamical random transitions
We present a (non‐standard) probabilistic analysis of dynamic data structures whose sizes are considered dynamic random walks… 
2003
2003
Performance Evaluation of Lazy Deletion Methods in R-trees
Motivated by the way R-trees are implemented in commercial databases systems, in this paper we examine several deletion… 
1992
1992
The velar glide in Axininca Campa
Black (1991) proposes that the failure of Velar Glide Deletion in some contexts motivates an iambic typology in which a… 
1977
1977
Comb Filter Improvement with Spurious Chroma Deletion
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)