NIST

LCFS hashing

(algorithm)

Definition: In case of collision, move the existing item to another position, dictated by the open addressing scheme used.

Aggregate parent (I am a part of or used in ...)
open addressing.

See also Robin Hood hashing, cuckoo hashing.

Note: Items that were previously placed in a position are displaced by a later arrival. The displaced item is then moved along to the next position in the open addressing scheme. It may find an empty position or will displace another item and take its position.

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 September 2015.
HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:
Paul E. Black, "LCFS hashing", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 September 2015. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/lcfsHashing.html