Bender[REF] argues that clusters are small.
A quotient filter requires 10-25% more space than a comparable Bloom filter but is faster because each access requires evaluating only a single hash function [REF].