aboutsummaryrefslogtreecommitdiff
path: root/src/backend
diff options
context:
space:
mode:
Diffstat (limited to 'src/backend')
-rw-r--r--src/backend/access/brin/brin_bloom.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/backend/access/brin/brin_bloom.c b/src/backend/access/brin/brin_bloom.c
index 2c8a20aaca6..09b8d04a46a 100644
--- a/src/backend/access/brin/brin_bloom.c
+++ b/src/backend/access/brin/brin_bloom.c
@@ -49,7 +49,7 @@
* We use a scheme requiring only two functions described in this paper:
*
* Less Hashing, Same Performance:Building a Better Bloom Filter
- * Adam Kirsch, Michael Mitzenmacher†, Harvard School of Engineering and
+ * Adam Kirsch, Michael Mitzenmacher, Harvard School of Engineering and
* Applied Sciences, Cambridge, Massachusetts [DOI 10.1002/rsa.20208]
*
* The two hash functions h1 and h2 are calculated using hard-coded seeds,