News for hackers. Stuff that matters.

A comment on Scientists Find Optimal Balance of Data Storage and Time. Parent comment

Re:Scientists Find Optimal Balance of Data Storage and Time by vlovich123 on Friday February 09, 2024 @06:29PM (#39321801)
My hunch is that boomphf will outperform and also supports any key type: https://github.com/10XGenomics/rust-boomphf

Construction is ~10m keys/s on old hardware and uses very few bits per key.

Implementation is based on the bbhash paper: https://arxiv.org/abs/1702.03154

[ Parent | on HN ]
Re:Scientists Find Optimal Balance of Data Storage and Time by trentnelson on Friday February 09, 2024 @09:05PM (#39322832)
What’s its fastest index function look like in assembly? My MultiplyShiftRX clocks in at like 5 cycles on x64 and 3 cycles on my M1. Mine is optimized for offline table generation so construction speed isn’t really relevant for its primary use.
[ Parent | on HN ]