MurmurHash算法由Austin Appleby创建，包括三个版本：MurmurHash1、MurmurHash2和MurmurHash3。MurmurHash3是最新版，适用于生成大块数据的独特标识，提供了32位和128位版本。其混合函数基于特定的常数和旋转操作，而最终器通过模拟退火算法生成，确保了良好的雪崩效应。性能测试显示，MurmurHash3在某些平台上能达到约5058 mb/sec的速度。
MurmurHash算法
MurmurHash算法是由Austin Appleby08年创立的。
项目链接：https://code.google.com/p/smhasher/
原文摘录，作者应为Austin Appleby
There are three versions of MurmurHash -
MurmurHash1 was my first attempt, and was measurably faster than Bob Jenkins’ lookup3 but not particularly robust.
MurmurHash2 was much, much faster and more robust. It has found its way into a lot of production codebases - it’s used in code by Google, Microsoft, Yahoo, and many others.
MurmurHash3 is the current version. It was developed after a few people noticed some minor flaws in MurmurHash2. MurmurHash3 is a bit faster than MurmurHash2, and should be darn near bulletproof. It also has a super-speedy 128-bit variant for x64 processors, which is useful when trying to generate unique identifiers for large chunks of data.
最低0.47元/天 解锁文章
5333
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
