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

More information

Pat Morin, Hash Tables, Sec. 1.3.9, pages 1-13 to 1-14. © CRC Press, 2001. Accessed 17 Sept 2015

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 19 January 2021.
HTML page formatted Tue Jan 19 08:57:16 2021.

Cite this as:
Paul E. Black, "LCFS hashing", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 19 January 2021. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/lcfsHashing.html