VLDB also just published a paper on a similar, improved bloom-like data structure
"Vacuum Filters: More Space-Efficient and Faster Replacement for Bloom and Cuckoo Filters"
http://www.vldb.org/pvldb/vol13/p197-wang.pdf
It would be interesting to get a comparison between Xor and Vacuum.
To me it looks like a version of the cuckoo filter that isn't restricted to a 2^n size. We made the same change in the benchmark of the xor filter against the cuckoo filter (and others made the same change). There are some more changes, and the paper claims the vacuum filter is faster than the cuckoo filter. I will try to add the vacuum filter to our benchmark suite at https://github.com/FastFilter/fastfilter_cpp and see what results I get.
It would be interesting to get a comparison between Xor and Vacuum.