Hacker GitHub

← All repos

senderista/hashtable-benchmarks

View on GitHub ↗ ★ 40 Java

An Evaluation of Linear Probing Hashtable Algorithms

16 mentions on Hacker News by 1 person: 1 story, 15 comments · first 2019-11-02 · latest 2025-04-16

Mentions per year 16 mentions · busiest year 2020 (5)
20082026
AllStoriesComments NewestTopOldest
  1. …but it's far inferior to others (several of which I catalogued here, along with their inverses: https://github.com/senderista/hashtable-benchmarks/tree/mast... ). The important thing to remember is that multiplication only mixes low bits…
    comment by senderista · 2025-04-16 · in Fibonacci Hashing: The Optimization That the World Forgot
  2. …linear probing to outperform Robin Hood across the board in my Java integer set benchmarks: https://github.com/senderista/hashtable-benchmarks/blob/mast... https://github.com/senderista/hashtable-benchmarks/wiki/64-b...
    comment by senderista · 2023-12-20 · in Building a faster hash table for high performance SQL joins
  3. …projects in Rust and Java as well (e.g., https://github.com/senderista/rotated-array-set , https://github.com/senderista/hashtable-benchmarks ). I would enjoy using Rust or Zig on a new project, but I consider the project itself to be much…
    comment by senderista · 2023-12-02 · in Ask HN: Who wants to be hired? (December 2023)
  4. …to be. The hash table constructor divides max data size by load factor to get the table size ( https://github.com/senderista/hashtable-benchmarks/blob/mast... ), and the benchmark code instantiates each hash table for exactly the measured…
    comment by senderista · 2023-11-14 · in Hashmaps in Factor are faster than in Zig
  5. …for the benchmark references. I would be curious what you think of my benchmarks of RH and BLP: https://github.com/senderista/hashtable-benchmarks/wiki/64-b... . BLP performance seems much more stable than RH in general. I haven't directly…
    comment by senderista · 2023-11-13 · in Hashmaps in Factor are faster than in Zig
  6. …(where you can't move entries around). The tombstone-free deletion algorithm is quite simple: https://github.com/senderista/hashtable-benchmarks/blob/mast... . No rehashing is necessary.
    comment by senderista · 2023-11-11 · in Hashmaps in Factor are faster than in Zig
  7. …projects in Rust and Java as well (e.g., https://github.com/senderista/rotated-array-set , https://github.com/senderista/hashtable-benchmarks ). I would enjoy using Rust or Zig on a new project, but I consider the project itself to be much…
    comment by senderista · 2022-03-03 · in Ask HN: Who wants to be hired? (March 2022)
  8. …from this paper in my evaluation of linear probing algorithms, where it outperformed Robin Hood: https://github.com/senderista/hashtable-benchmarks .
    comment by senderista · 2020-05-03 · in Concurrent Hash Tables: Fast and General? (2019)
  9. …which can handle load factor >90% with good performance. I implemented and benchmarked it here: https://github.com/senderista/hashtable-benchmarks . Storing integer keys as their hash values (using a reversible hash function) also helps…
    comment by senderista · 2020-03-11 · in Show HN: A Simple GPU Hash Table
  10. …in industry: a couple examples are my projects https://github.com/senderista/rotated-array-set and https://github.com/senderista/hashtable-benchmarks , which implement and benchmark little-known but promising papers from 1979 (Munro's…
    comment by senderista · 2020-02-07 · in Ask HN: Who wants to be hired? (February 2020)
  11. This is sad news. I used Packet for a benchmarking project ( https://github.com/senderista/hashtable-benchmarks ) and was super impressed by the ease of use. Put EC2 absolutely to shame (and was much cheaper than EC2’s bare metal offering).
    comment by senderista · 2020-01-14 · in Equinix is acquiring Packet
  12. …useful in industry: a couple examples are my projects https://github.com/senderista/sorted-vec and https://github.com/senderista/hashtable-benchmarks , which implement and benchmark little-known but promising papers from 1979 (Munro's…
    comment by senderista · 2020-01-05 · in Ask HN: Who wants to be hired? (January 2020)
  13. …the keys by their hash code values. See e.g., my implementation of bidirectional linear probing: https://github.com/senderista/hashtable-benchmarks/blob/mast... .
    comment by senderista · 2019-12-10 · in Why databases use ordered indexes but programming uses hash tables
  14. Spoiler: the overall best algorithm is one you've probably never heard of... Code: https://github.com/senderista/hashtable-benchmarks Docs: https://senderista.github.io/hashtable-benchmarks/ Graphs: https://github.com/senderista/hashtable-b…
    comment by senderista · 2019-11-05 · in Show HN: An Empirical Evaluation of Linear Probing Algorithms
  15. …useful in industry: a couple examples are my projects https://github.com/senderista/sorted-vec and https://github.com/senderista/hashtable-benchmarks , which implement and benchmark little-known but promising papers from 1979 (Munro's…
    comment by senderista · 2019-11-02 · in Ask HN: Who wants to be hired? (November 2019)