MurmurHash Function
(Redirected from MurmurHash)
Jump to navigation
Jump to search
A MurmurHash Function is a non-cryptographic hash function suitable for general hash-based lookup.
- See: Hash Function, Bloom Filter.
References
2013
- http://en.wikipedia.org/wiki/MurmurHash
- MurmurHash is a non-cryptographic hash function suitable for general hash-based lookup.[1][2][3] It was created by Austin Appleby in 2008,[4][5] and exists in a number of variants,[6] all of which have been released into the public domain. When compared to other popular hash functions, MurmurHash performed well in a random distribution of regular keys.[7]
- ↑ "Hadoop in Java". Hbase.apache.org. 24 July 2011. http://hbase.apache.org/docs/current/api/org/apache/hadoop/hbase/util/MurmurHash.html. Retrieved 13 January 2012.
- ↑ Chouza et al.
- ↑ "Couceiro et al." (in Template:Pt icon) (PDF). http://www.inesc-id.pt/ficheiros/publicacoes/5453.pdf. Retrieved 13 January 2012.
- ↑ "MurmurHash on GooglePages". Murmurhash.googlepages.com. http://murmurhash.googlepages.com/. Retrieved 13 January 2012.
- ↑ Tanjent (tanjent) wrote,3 March 2008 13:31:00. "MurmurHash first announcement". Tanjent.livejournal.com. http://tanjent.livejournal.com/756623.html. Retrieved 13 January 2012.
- ↑ "MurmurHash2-160". Simonhf.wordpress.com. 25 September 2010. http://simonhf.wordpress.com/2010/09/25/murmurhash160/. Retrieved 13 January 2012.
- ↑ "Which hashing algorithm is best for uniqueness and speed". stackexchange.com. http://programmers.stackexchange.com/questions/49550/which-hashing-algorithm-is-best-for-uniqueness-and-speed.