Building an efficient hash table in Java

54 pointsposted 15 hours ago
by birdculture

5 Comments

EmberTwin

14 hours ago

The SWAR (SIMD-within-a-register) numbers are strictly better than the SIMD versions as well as the standard library baseline. Why is that? SIMD should be strictly faster if the machine supports it, since the SWAR max bitwidth is 64, while SIMD starts at 128 bits.

The Java SIMD API used here must not result in using actual SIMD machine code.

yardstick

13 hours ago

The article wasn’t great at laying out the concepts at the start. As I understand it, the big idea is essentially a bloom filter as the first phase of a retrieval.

jbellis

14 hours ago

Now I'm curious about what fastutil's implementation is doing.

user

14 hours ago

[deleted]