3 ms·
And modern data structures always outperform classical ones. Why cuckoo when you usually use swiss tables or stanford tables for longs? Or https://greg7mdp.git
by rurban 5y ago
And modern data structures always outperform classical ones.
Why cuckoo when you usually use swiss tables or stanford tables for longs? Or https://greg7mdp.github.io/parallel-hashmap/ https://greg7mdp.github.io/parallel-hashmap/ for concurrent htables?
Learned indices (ie dynamic data structures optimized to the data) usually outperform these as well if they are properly optimized. Which can be neural nets, but also perfect hashes or just better dynamic lookup methods. Like three-way array lookups, properly compressed, as with Unicode. Not everything needs to be a NN, though it helps if you see no structure in the data.