MurmurHash算法

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
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值