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 …

Bloom filters are used to perform approximate membership checking in a wide range of
applications in both computing and networking, but the recently introduced cuckoo filter is …

Bloom filter is a probabilistic data structure to filter a membership of a set. Bloom filter returns
“true” or “false” with an error tolerance depending on the presence of the element in the set …

Malicious URL detection is an emerging research area due to the continuous modernization
of various systems, for instance, Edge Computing. This article presents a novel malicious …

Abstract Routing protocol in Information Centric Network (ICN) prepares Forward Information
Base (FIB) and routing table to assist the process of content retrieval. The content seeker …

Bloom Filter is a data structure for membership filtering that is deployed in various domains
to boost up the lookup performance and to lower the memory consumption. Bloom Filter has …

Abstract The recently proposed Learned Bloom Filter (LBF) provides a new perspective on
large-scale membership queries by using machine learning to replace the traditional bloom …

A Bloom filter is a special case of an artificial neural network with two layers. Traditionally, it
is seen as a simple data structure supporting membership queries on a set. The standard …

As a key component in implementing Named Data Networking (NDN), Pending Interest
Table (PIT) requires an efficient exact-matching algorithm for a scalable and fast PIT lookup …

Bloom Filter is a probabilistic data structure for the membership query, and it has been
intensely experimented in various fields to reduce memory consumption and enhance a …