Bloom filter (BF) has been widely used to support membership query, ie, to judge whether a
given element x is a member of a given set S or not. Recent years have seen a flourish …

High-throughput sequencing data sets are usually deposited in public repositories (eg, the
European Nucleotide Archive) to ensure reproducibility. As the amount of data has reached …

In many networking systems, Bloom filters are used for high-speed set membership tests.
They permit a small fraction of false positive answers with very good space efficiency …

Recently, the log-structured merge-tree (LSM-tree) has been widely adopted for use in the
storage layer of modern NoSQL systems. Because of this, there have been a large number …

The non-volatile memory (NVM) has DRAM-like performance and disk-like persistency
which make it possible to replace both disk and DRAM to build single level systems. To keep …

Data management workloads are increasingly write-intensive and subject to strict latency
SLAs. This presents a dilemma: Update in place systems have unmatched latency but poor …

Approximate Membership Query (AMQ) data structures, such as the Bloom filter, quotient
filter, and cuckoo filter, have found numerous applications in databases, storage systems …

This book addresses researchers and graduate students at the forefront of study/research on
the Internet of Things (IoT) by presenting state-of-the-art research together with the current …

We introduce Rosetta, a probabilistic range filter designed specifically for LSM-tree based
key-value stores. The core intuition is that we can sacrifice filter probe time because it is not …

As the Internet and the amount of data grows, the variability of data sizes grows too—from
small MP3 tags to large VM images. With applications using increasingly more complex …