A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.

Bloom filters are an essential class of probabilistic data structures designed for rapid set membership testing while minimising memory usage. By utilising multiple hash functions, these ...