Record · corpus.blog/posts/01a0bb8d-ead4-737b-aec5-8e4acb5e420d

Xor Filters: Faster and Smaller Than Bloom Filters

Daniel Lemire · published 19 December 2019

A record is what was published and who pointed at it. The text of the post is not held here: read it at the source, or at its Wayback capture.

Read the post at lemire.me Wayback capture

4blogs citing

First cited: 26 Jan 2021
Most recent: 14 Sept 2026
Rank this month: not ranked
Links from this post: 12
Words captured: 1,144

Cited by

Blog

In the post

Date

char.lt

designing a storage engine for AT Protocol backlinks Read at the source ↗

14 Sept 2026

bohutang.me

Rust, Databend and the Cloud Warehouse (7) Using Xor Filter to Replace Bloom Filter for Faster Queries Read at the source ↗

21 Nov 2022

cj.rs

Academic Papers 2021 Read at the source ↗

21 Aug 2021

devlog.hexops.org

Postgres Trigram search learnings Read at the source ↗

26 Jan 2021

Links from this post

Link

Host

https://en.wikipedia.org/wiki/Bloom_filter

en.wikipedia.org

https://en.wikipedia.org/wiki/Cuckoo_filter

en.wikipedia.org

https://arxiv.org/abs/1912.08258

arxiv.org

http://lemire.me/blog/wp-content/uploads/2019/12/comparison.png

lemire.me

https://github.com/FastFilter/xorfilter/blob/master/xorfilter.go

github.com

https://github.com/FastFilter/xor_singleheader

github.com

https://github.com/FastFilter/FilterPassword

github.com

https://github.com/FastFilter/fastfilter_java

github.com

https://github.com/FastFilter/fastfilter_cpp

github.com

https://github.com/bnclabs/xorfilter

github.com

https://github.com/FastFilter/pyfusefilter

github.com

https://github.com/mpope9/exor_filter

github.com