News for hackers. Stuff that matters.
Re:The One Billion Row Challenge by gpderetta on Thursday January 04, 2024 @08:57AM (#38866999)
> Read with O_DIRECT

apparently the challenge explicitly allow for warming up the os cache on a prior run, so O_DIRECT would be disadvantaged here as the working set fits in memory.

edit: also in my very simple tests a good hashmap can beat linear search already at <10 items. It depends a lot on the hash function cost.

Re:The One Billion Row Challenge by weinzierl on Thursday January 04, 2024 @10:06AM (#38867853)
> beat linear search already at <10 items

The sources I found corroborate this. My 1000 elements rule of thumb is apparently way off.