A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.
I’ve only used java but java hash tables are stupid fast in my experience, like everything else in my crap programs was 1000 times slower than the hash table access or storage.
Just reading the title, it’s talking about searching hash tables, which wasn’t something I was specifically doing.
I’ve only used java but java hash tables are stupid fast in my experience, like everything else in my crap programs was 1000 times slower than the hash table access or storage.
Just reading the title, it’s talking about searching hash tables, which wasn’t something I was specifically doing.