Binary Fuse Filters: Fast and Smaller Than Xor Filters

Fuse XORier 查找表：概率集合与映射的探索、实现与修订

The Fuse XORier Lookup Table: Exploration, Implementation, and Revision of Probabilistic Sets and Maps

本文提出 Fuse XORier 查找表（FXLT），一种增强版 Bloomier 过滤器，通过空间耦合与线性构造优化，在空间和时间效率上优于传统方法，并在大数据集上与哈希表竞争。

Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters

The Bloom filter provides fast approximate set membership while using little memory. Engineers often use these filters to avoid slow operations such as disk or network accesses. As an alternative, a cuckoo filter may need less space than a Bloom filter and it is faster. Chazelle et al. proposed a generalization of the Bloom filter called the Bloomier filter. Dietzfelbinger and Pagh described a variation on the Bloomier filter that can be used effectively for approximate membership queries. It has never been tested empirically, to our knowledge. We review an efficient implementation of their ap…

ZOR过滤器：比融合过滤器更快且更小

ZOR filters: fast and smaller than fuse filters

ZOR过滤器通过确定性剥离技术在保持异或查询性能的同时，实现了比融合过滤器更小的开销和更快的构建速度。

Ribbon filter: practically smaller than Bloom and Xor

Filter data structures over-approximate a set of hashable keys, i.e. set membership queries may incorrectly come out positive. A filter with false positive rate $f \in (0,1]$ is known to require $\ge \log_2(1/f)$ bits per key. At least for larger $f \ge 2^{-4}$, existing practical filters require a space overhead of at least 20% with respect to this information-theoretic bound. We introduce the Ribbon filter: a new filter for static sets with a broad range of configurable space overheads and false positive rates with competitive speed over that range, especially for larger $f \ge 2^{-7}$. In m…

Approximate Membership Query Filters with a False Positive Free Set

In the last decade, significant efforts have been made to reduce the false positive rate of approximate membership checking structures. This has led to the development of new structures such as cuckoo filters and xor filters. Adaptive filters that can react to false positives as they occur to avoid them for future queries to the same elements have also been recently developed. In this paper, we propose a new type of static filters that completely avoid false positives for a given set of negative elements and show how they can be efficiently implemented using xor probing filters. Several constr…

带选择的分块布隆过滤器

Blocked Bloom Filters with Choices

本文提出带选择的分块布隆过滤器，通过为每个键提供多个备选块，在保留快速在线插入和轻微过载优势的同时，有效降低了空间消耗或假阳性率，并在生物信息学用例中验证了其实用价值。