I wonder at their scale, why wouldn’t it make sense to store the entries lightly compressed in memory?
Yeah with snappy they probably could get like 30% savings (I bet domains don't compress well) without much more cpu usage.
Alternatively a btree somehow they can take advantage of prefix compression
alt Hacker News
Yeah with snappy they probably could get like 30% savings (I bet domains don't compress well) without much more cpu usage.
Alternatively a btree somehow they can take advantage of prefix compression