| 翻訳と辞書 |
MurmurHash
MurmurHash is a non-cryptographic hash function suitable for general hash-based lookup.〔(Chouza et al ).〕 It was created by Austin Appleby in 2008,〔(【引用サイトリンク】title=MurmurHash on GooglePages )〕 and exists in a number of variants, all of which have been released into the public domain. The name comes from two basic operations, multiply (MU) and rotate (R), though the algorithm actually uses shift and xor instead of rotate.〔(【引用サイトリンク】title=MurmurHash website )〕
Unlike cryptographic hash functions, it is not specifically designed to be difficult to reverse by an adversary, making it unsuitable for cryptographic purposes.
==Variants==
The current version is MurmurHash3, which yields a 32-bit or 128-bit hash value.
The older MurmurHash2 yields a 32-bit or 64-bit value. Slower versions of MurmurHash2 are available for big-endian and aligned-only machines. The MurmurHash2A variant adds the Merkle–Damgård construction so that it can be called incrementally. There are two variants which generate 64-bit values; MurmurHash64A, which is optimized for 64-bit processors, and MurmurHash64B, for 32-bit ones. MurmurHash2-160 generates the 160-bit hash, and MurmurHash1 is obsolete.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「MurmurHash」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|