Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
These new benchmark results are after I removed the "make([]uint, this.k)" from bits() function. Instead we just do a make at the New() time, and re-use the same slice for each add/check.
Partitioned Bloom Filter
------------------------
BenchmarkBloomFNV64 1000000 1032 ns/op
BenchmarkBloomCRC64 1000000 1032 ns/op
BenchmarkBloomMurmur3 1000000 1008 ns/op (ignore, invalid due to murmur3 impl or incorrect usage)
BenchmarkBloomCityHash 1000000 3345 ns/op (ignore, most likely slow due to my cityhash impl)
BenchmarkBloomMD5 1000000 2349 ns/op
BenchmarkBloomSha1 1000000 2551 ns/op
Standard Bloom Filter
---------------------
BenchmarkBloomFNV64 1000000 1058 ns/op
BenchmarkBloomCRC64 1000000 1036 ns/op
BenchmarkBloomMurmur3 2000000 1039 ns/op (ignore, invalid due to murmur3 impl or incorrect usage)
BenchmarkBloomCityHash 1000000 3296 ns/op (ignore, most likely slow due to my cityhash impl)
BenchmarkBloomMD5 1000000 2292 ns/op
BenchmarkBloomSha1 1000000 2552 ns/op
Scalable Bloom Filter
---------------------
BenchmarkBloomFNV64 1000000 1067 ns/op
BenchmarkBloomCRC64 1000000 1082 ns/op
BenchmarkBloomMurmur3 1000000 1079 ns/op (ignore, invalid due to murmur3 impl or incorrect usage)
BenchmarkBloomCityHash 1000000 3375 ns/op (ignore, most likely slow due to my cityhash impl)
BenchmarkBloomMD5 1000000 2382 ns/op
BenchmarkBloomSha1 1000000 2660 ns/op
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment