NIST

Robin Hood hashing

(algorithm)

Definition: In case of collision, the item with the longer probe sequence stays in the position. The other item is moved. This tends to equalize the length of probe sequences.

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

See also LCFS hashing, cuckoo hashing.

Note: An item that was previously placed in a position may be displaced by a later arrival. The displaced item is then moved along. It may find an empty position, may displace another item and take its position, or may not disturb the other item and check the next position.

Author: PEB

More information

Pedro Celis, Robin Hood Hashing, Doctoral Thesis, Technical Report CS-86-14, Computer Science Department, University of Waterloo, Waterloo, ON, Canada, 1986.
Pedro Celis, P.-A. Larson, and J. I. Munro Robin Hood hashing, Proc. 26th IEEE Symp. on Foundations of Comp. Sci., 1985, 281-288.


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, "Robin Hood 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/robinHoodHashing.html