2011.12.30 15:24:48 (152757030631907328) from Daniel J. Bernstein, replying to "Jason Miller (@Aidenn0)" (152260134272385024):
@Aidenn0 No. Crit-bit trees keep many top layers in cache, and standard "clustering" tricks make the bottom layers cache-friendly too.
2011.12.28 17:59:11 (152071106919014401) from Daniel J. Bernstein:
The ultimate solution to #hashflooding: language/library designers should switch to crit-bit trees. http://cr.yp.to/critbit.html
2011.12.29 06:30:19 (152260134272385024) from "Jason Miller (@Aidenn0)":
@hashbreaker crit-bit trees are very cache unfriendly; isn't some sort of randomized hash going to do better?