Hash Table Implementations

Comments discuss various hash table techniques like cuckoo hashing, robin hood hashing, swiss tables, and probing vs chaining, comparing their speed, space efficiency, and performance against alternatives.

➡️ Stable 0.6x Programming Languages
5,320
Comments
20
Years Active
5
Top Authors
#9648
Topic ID

Activity Over Time

2007
4
2008
33
2009
100
2010
138
2011
173
2012
190
2013
176
2014
238
2015
213
2016
369
2017
361
2018
323
2019
456
2020
378
2021
447
2022
411
2023
433
2024
396
2025
461
2026
20

Keywords

NaNs SPOOKY32 CPU norswap.com khash.h IME ksort.h kbtree.h CuckooHash.pdf SipHash hash tables table hashing collisions hashes computed data structures functions structures

Sample Comments

prirun Jul 7, 2022 View on HN

They should have looked into consistent or jump hashing.

haggy Mar 21, 2019 View on HN

Where does it say that this is the fastest hash table implementation?

n2d4 Feb 21, 2025 View on HN

A hash table implementation that's faster than the usual

jnwatson Dec 13, 2024 View on HN

Hash tables and related data structures.

internetter Feb 11, 2025 View on HN

What you just described is magnitudes slower than even conventional hash tables

mda Jan 8, 2020 View on HN

If author just used a fast hash table (swiss table etc) results would immediately look very different.

viraptor Jan 4, 2024 View on HN

Search for cuckoo hashing. It's a whole thing for data structures.

PartiallyTyped Aug 20, 2023 View on HN

Same for hash related algorithms and data structures.

eru Oct 2, 2020 View on HN

It depends on what implementation of hash tables you use.

detrino Jul 13, 2015 View on HN

Sorry, it's early, I was thinking about cuckoo hashing.