From cc75d222df1095977f3b1d0635d9e2779eed6daa Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Andr=C3=A9=20Laszlo?= Date: Thu, 18 May 2017 13:18:44 +0200 Subject: [PATCH] Fix broken url to "Building a Better Bloom Filter" --- src/java/org/apache/cassandra/utils/BloomFilter.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/java/org/apache/cassandra/utils/BloomFilter.java b/src/java/org/apache/cassandra/utils/BloomFilter.java index 77b2d44480..22890711c9 100644 --- a/src/java/org/apache/cassandra/utils/BloomFilter.java +++ b/src/java/org/apache/cassandra/utils/BloomFilter.java @@ -53,7 +53,7 @@ protected long[] initialValue() // Murmur is faster than an SHA-based approach and provides as-good collision // resistance. The combinatorial generation approach described in - // http://www.eecs.harvard.edu/~kirsch/pubs/bbbf/esa06.pdf + // https://www.eecs.harvard.edu/~michaelm/postscripts/tr-02-05.pdf // does prove to work in actual tests, and is obviously faster // than performing further iterations of murmur. protected abstract void hash(ByteBuffer b, int position, int remaining, long seed, long[] result);