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 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, displace another item and take its position, or leave the other item and check the next position.
Author: PEB
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.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 25 January 2010.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Paul E. Black, "Robin Hood hashing", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 25 January 2010. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/robinHoodHashing.html
