Spectral Bloom Filters for Client Side Search

Abstract

A Bloom filter is a space-efficient probabilistic data structure that allows for set membership queries with some degree of false positives. In this paper, we propose a technique to add search functionality using a variant of Bloom filters - Spectral Bloom filters. Apart from being space-efficient, our proposed solution produces results comparable to search techniques such as Inverted Index and is a strong candidate for client-side searching.