Lazy deletion
id:
lazy-deletion-236-12761322
title:
Lazy deletion
text:
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 done by marking an element as deleted, rather than erasing it entirely. Deleted locations are treated as empty when inserting and as occupied during a search. The deleted locations are sometimes referred to as tombstones. The problem with this scheme is that as the number of delete/insert operations increases, the cost of a successful search increa
brand slug:
wiki
category slug:
encyclopedia
description:
Concept in computer science
original url:
https://en.wikipedia.org/wiki/Lazy_deletion
date created:
date modified:
2024-02-29T12:12:01Z
main entity:
{"identifier":"Q6506152","url":"https://www.wikidata.org/entity/Q6506152"}
image:
fields total:
13
integrity:
14