Results 11 to 20 of about 628,634 (288)
PSBF: p-adic Integer Scalable Bloom Filter [PDF]
Given the challenges associated with the dynamic expansion of the conventional bloom filter’s capacity, the prevalence of false positives, and the subpar access performance, this study employs the algebraic and topological characteristics of p-adic ...
Wenlong Yi +4 more
doaj +3 more sources
BLOOM: BLoom filter based oblivious outsourced matchings [PDF]
Background Whole genome sequencing has become fast, accurate, and cheap, paving the way towards the large-scale collection and processing of human genome data. Unfortunately, this dawning genome era does not only promise tremendous advances in biomedical
Jan Henrik Ziegeldorf +8 more
doaj +2 more sources
Suitability of a new Bloom filter for numerical vectors with high dimensions. [PDF]
The notable increase in the size and dimensions of data have presented challenges for data storage and retrieval. The Bloom filter and its generations, due to efficient space overheads and constant query delays, have been broadly applied to querying ...
Chunyan Shuai +3 more
doaj +2 more sources
Bloom filter variants for multiple sets: a comparative assessment [PDF]
In this paper we compare two probabilistic data structures for association queries derived from the well-known Bloom filter: the shifting Bloom filter (ShBF), and the spatial Bloom filter (SBF).
Luca Calderoni +2 more
doaj +5 more sources
Preventing DDoS using Bloom Filter: A Survey
Distributed Denial-of-Service (DDoS) is a menace for service provider and prominent issue in network security. Defeating or defending the DDoS is a prime challenge. DDoS make a service unavailable for a certain time.
Ripon Patgiri +2 more
doaj +2 more sources
The deletable Bloom filter: a new member of the Bloom family [PDF]
We introduce the Deletable Bloom filter (DlBF) as a new spin on the popular data structure based on compactly encoding the information of where collisions happen when inserting elements. The DlBF design enables false-negative-free deletions at a fraction of the cost in memory consumption, which turns to be appealing for certain probabilistic filter ...
Fabio Verdi +2 more
exaly +5 more sources
A Distance-Encoded Bloom Filter for Fast NDN Name Lookup
Named data networking (NDN) is a content-centric network architecture that requires efficient name lookup to forward packets based on hierarchical content names.
Junghwan Kim, Myeong-Cheol Ko
doaj +2 more sources
A New Bloom Filter Architecture for FIB Lookup in Named Data Networking
Network traffic has increased rapidly in recent years, mainly associated with the massive growth of various applications on mobile devices. Named data networking (NDN) technology has been proposed as a future Internet architecture for effectively ...
Hayoung Byun, Hyesook Lim
doaj +3 more sources
Proactive detection of DDOS attacks in Publish-Subscribe networks [PDF]
Information centric networking (ICN) using architectures such as Publish-Subscribe Internet Routing Paradigm (PSIRP) or Publish-Subscribe Internet Technology (PURSUIT) has been proposed as an important candidate for the Internet of the future.
Alreshoodi, Mohammed +10 more
core +4 more sources
Quantum Bloom Filter and Its Applications
A quantum Bloom filter is a spatially more efficient data structure which is used to represent a set of $n$ elements by using $O({{\rm{log}}nk})$ qubits. In this article, we define and design a quantum Bloom filter and its corresponding algorithms.
Run-Hua Shi
doaj +1 more source

