Matrix Bloom Filter: An Efficient Probabilistic Data Structure for 2-tuple Batch Lookup

Abstract

With the growing scale of big data, probabilistic structures receive increasing popularity for efficient approximate storage and query processing. For example, Bloom filters (BF) can achieve satisfactory performance for approximate membership existence query at the expense of false positives. However, a standard Bloom filter can only handle univariate data and single membership existence query, which is insufficient for OLAP and machine learning applications. In this paper, we focus on a common multivariate data type, namely, 2-tuples, or equivalently, key-value pairs. We design the matrix Bloom filter as a high-dimensional extension of the standard Bloom filter. This new probabilistic data structure can not only insert and lookup a single 2-tuple efficiently, but also support these operations efficiently in batches -a key requirement for OLAP and machine learning tasks. To further balance the insertion and query efficiency for different workload patterns, we propose two variants, namely, the maximum adaptive matrix BF and minimum storage matrix BF. Through both theoretical and empirical studies, we show the performance of matrix Bloom filter is superior on datasets with common statistical distributions; and even without them, it just degrades to a standard Bloom filter.

PA‐LBF: Prefix‐Based and Adaptive Learned Bloom Filter for Spatial Data

“…Patgiri et al [18] focused on diferent dimensional data structures and proposed an r-dimensional bloom flter (rDBF), which achieved better performance than the Cuckoo flter in FPR and memory usage. Fu et al [19] designed the matrix bloom flter as a high-dimensional extension of the standard bloom flter, which can support inserting and looking up a single 2-tuple efciently.…”