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 …

As a challenging attempt to replace a traditional data structure with a learned model, this
paper proposes a learned functional Bloom filter (L-FBF) for a key–value storage. The …

SRAM-based field programmable gate arrays (FPGAs) are widely used in mission-critical
applications, such as aerospace and avionics. Due to the increasing working frequency and …

A basic operation in big data analysis is to find the cardinality estimate; to estimate the
cardinality at high speed and with a low memory requirement, data sketches that provide …

An invertible Bloom filter (IBF) is a useful data structure for various network applications
because the difference IBF (d-IBF) of two IBFs programmed by two separate sets effectively …

Hash-based data structures have been widely used in many applications. An intrinsic
problem of hashing is collision, in which two or more elements are hashed to the same …

FPGAs have become a well-established solution for systems aiming for high performance
and flexibility. FPGA-based SoCs have facilitated the integration of software programmability …

For some applications, errors have a different impact on data and memory systems
depending on whether they change a zero to a one or the other way around; for an unsigned …

The slowdown of CMOS technology scaling has placed architectures and algorithms on
focus for future performance improvements in nanoscale computing systems. Two promising …

Estimating the number of distinct elements is required in many computing applications. For
example, we may want to estimate the number of unique users accessing a service, or the …