Re:Writing a Very Fast Hash Table with Tiny Memory Footprints
by adrianN on Tuesday May 09, 2017 @11:30AM
(#14300847)
You don't replace every map in your code with a distributed Key-Value store, in case it might need to store terabytes in the future. Most of the time you have a pretty good idea whether a map has to store a hundred, or a hundred thousand elements.
[ Parent
| on HN ]
There are no comments on this comment yet.