Dense Peelable Random Uniform Hypergraphs — mentioned by thomasmg

Wed, 11 Aug 2021 07:27:50 GMT

Yes. Some variants of ribbon filters are very fast, and other variants (which are a bit slower thought) need very little space: only a few percent more than the theoretical lower bound. For static sets, ribbon filters and binary fuse filters (e.g. here: https://github.com/FastFilter/xor_singleheader) are very competitive. Both are based on recent (2019 and newer) theoretical work from Stefan Walzer, e.g. this one https://arxiv.org/pdf/1907.04749.pdf

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

Dense Peelable Random Uniform Hypergraphs · HackerPapers discussions

Dense Peelable Random Uniform Hypergraphs — mentioned by thomasmg