Results 41 to 50 of about 628,634 (288)
CoRR, 2019 The Distributed Bloom Filter is a space-efficient, probabilistic data structure designed to perform more efficient set reconciliations in distributed systems. It guarantees eventual consistency of states between nodes in a system, while still keeping bloom filter sizes as compact as possible.
Lum Ramabaja, Arber Avdullahu
openaire +3 more sources
Bloom Filters in Adversarial Environments [PDF]
ACM Transactions on Algorithms, 2015 Many efficient data structures use randomness, allowing them to improve upon deterministic ones. Usually, their efficiency and correctness are analyzed using probabilistic tools under the assumption that the inputs and queries are independent of the internal randomness of the data structure.
Moni Naor, Eylon Yogev
openaire +4 more sources
Let the Tree Bloom: Scalable Opportunistic Routing with ORPL [PDF]
, 2013 Routing in battery-operated wireless networks is challenging, posing a tradeoff between energy and latency. Previous work has shown that opportunistic routing can achieve low-latency data collection in duty-cycled networks.
Voigt, Thiemo, +7 more
core +1 more source
Adaptive Compression Trie Based Bloom Filter: Request Filter for NDN Content Store
IEEE Access, 2017 In named data networking (NDN), content store (CS) is proposed to provide on-path cache service. When user's request with content name is forwarded to NDN node, exact match in CS is carried out first.
Ran Zhang +4 more
doaj +1 more source
Partitioned Learned Bloom Filter
CoRR, 2020 Bloom filters are space-efficient probabilistic data structures that are used to test whether an element is a member of a set, and may return false positives. Recently, variations referred to as learned Bloom filters were developed that can provide improved performance in terms of the rate of false positives, by using a learned model for the ...
Kapil Vaidya +3 more
openaire +4 more sources
A Case for Partitioned Bloom Filters
IEEE Transactions on Computers, 2023 In a partitioned Bloom Filter the $m$ bit vector is split into $k$ disjoint $m/k$ sized parts, one per hash function. Contrary to hardware designs, where they prevail, software implementations mostly adopt standard Bloom filters, considering partitioned filters slightly worse, due to the slightly larger false positive rate (FPR).
openaire +2 more sources
Addition of a Secondary Functional Bloom Filter
, 2021 Key-value data structures have been extensively used in various applications. When a large amount of data needs to be compactly stored in a fixed memory size, a functional Bloom filter is a space-efficient key-value structure.
임혜숙
core +1 more source
Elastic Bloom Filter: Deletable and ExpandableFilter Using Elastic Fingerprints [PDF]
, 2021 International audienceThe Bloom filter, answering whether an item is in a set, has achieved great success in various fields, including networking, databases, and bioinformatics.
He, Jintao +7 more
core +1 more source
Applied Sciences, 2020 Because the development of the Internet of Things (IoT) requires technology that transfers information between objects without human intervention, the core of IoT security will be secure authentication between devices or between devices and servers ...
Jungwon Lee +4 more
doaj +1 more source