Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters · HackerPapers discussions

Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters — mentioned by convolvatron

Wed, 02 Jul 2025 18:38:37 GMT

the reference in the repo is paywalled (US$ 30!). I did find this https://arxiv.org/pdf/1912.08258 which may or may not be related. but what I found interesting is that the construction looks alot like perfect hashes

Paper and discussion history. A mention is not an endorsement.

Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters — mentioned by f_devd

Fri, 02 May 2025 08:21:41 GMT

> check the literature for various alternatives that are better in specific situations For direct replacements, see Xor(+)-Filters: https://arxiv.org/abs/1912.08258 and the subsequent evolution into Binary Fuse Filters: https://arxiv.org/abs/2201.01174

Paper and discussion history. A mention is not an endorsement.

Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters — mentioned by thomasmg

Wed, 11 Aug 2021 06:55:52 GMT

This paper seems to use an un-optimized Bloom filter implementation. It also lists cuckoo filters to be 10 times faster than Bloom filters. In other papers, e.g. the cuckoo filter paper and the xor filter paper, the difference is _much_ smaller; maybe factor 2. https://dl.acm.org/doi/pdf/10.1145/2674005.2674994 - figures 5 and 6 https://arxiv.org/abs/1912.08258 - figures 3b and 4b

Paper and discussion history. A mention is not an endorsement.

Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters — mentioned by 19h

Sat, 25 Jul 2020 18:09:51 GMT

Or you go with Xor filters, which are more efficient than both Cockoo and Bloom filters. [0] [0] https://arxiv.org/abs/1912.08258 ("Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters")

Paper and discussion history. A mention is not an endorsement.

Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters — mentioned by _visgean

Fri, 20 Dec 2019 12:47:03 GMT

He probably did not talk about it because this post was an announcement of his paper: https://arxiv.org/abs/1912.08258, the XOR filter description starts at page 3.

Paper and discussion history. A mention is not an endorsement.

Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters — mentioned by colinchartier

Fri, 20 Dec 2019 02:39:55 GMT

Direct link to paper (pdf) - https://arxiv.org/pdf/1912.08258.pdf I haven't fully read the paper yet, but it seems like a variation of a bloom filter where membership is determined by xoring three hashes (see algorithm 1 in the pdf)

Paper and discussion history. A mention is not an endorsement.