Lazy deletion

Lazy deletion

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. This is done so that elements inserted using open addressing techniques like linear probing do not become unfindable.


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Hash table — Not to be confused with Hash list or Hash tree. Unordered map redirects here. For the proposed C++ class, see unordered map (C++). Hash Table Type unsorted dictionary Invented 1953 Time complexity in big O notation Average Worst case Space …   Wikipedia

  • Open addressing — Hash collision resolved by linear probing (interval=1). Open addressing, or closed hashing, is a method of collision resolution in hash tables. With this method a hash collision is resolved by probing, or searching through alternate locations in… …   Wikipedia

  • Meta-model (NLP) — This article is about the concept of the meta model in Neuro linguistic programming. For other uses, see Meta model. NLP …   Wikipedia

  • Levenshtein distance — In information theory and computer science, the Levenshtein distance is a string metric for measuring the amount of difference between two sequences. The term edit distance is often used to refer specifically to Levenshtein distance. The… …   Wikipedia

  • Wikipedia:Glossary — Welcome to Wikipedia, which anyone can edit. Help index: Ask questions · Learn wikicode · View FAQ · Read Glossary · Live Wikipedia editing related help via web chat  …   Wikipedia

  • HEBREW GRAMMAR — The following entry is divided into two sections: an Introduction for the non specialist and (II) a detailed survey. [i] HEBREW GRAMMAR: AN INTRODUCTION There are four main phases in the history of the Hebrew language: the biblical or classical,… …   Encyclopedia of Judaism

  • Double-ended queue — Not to be confused with Double ended priority queue. In computer science, a double ended queue (dequeue, often abbreviated to deque, pronounced deck) is an abstract data structure that implements a queue for which elements can only be added to or …   Wikipedia

  • Fragile X syndrome — Classification and external resources Location of FMR1 gene ICD 10 Q99.2 …   Wikipedia

  • Reliability of Wikipedia — Vandalism of a Wikipedia article. The section on the left is the normal, undamaged version; and on the right is the edited, damaged version. The reliabili …   Wikipedia

  • Life Unexpected — Intertitle Also known as Light Years Parental Discretion Advised LUX Genre Drama …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”