Results 1 to 10 of about 119,966 (182)
BLOOM: BLoom filter based oblivious outsourced matchings [PDF]
BMC Medical Genomics, 2017 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 +7 more sources
PSBF: p-adic Integer Scalable Bloom Filter [PDF]
Sensors, 2023 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 +2 more sources
Preventing DDoS using Bloom Filter: A Survey
EAI Endorsed Transactions on Scalable Information Systems, 2018 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 +3 more sources
Suitability of a new Bloom filter for numerical vectors with high dimensions. [PDF]
PLoS ONE, 2018 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
Improving Bloom Filter Performance on Sequence Data Using k-mer Bloom Filters. [PDF]
J Comput Biol, 2017 Using a sequence's k-mer content rather than the full sequence directly has enabled significant performance improvements in several sequencing applications, such as metagenomic species identification, estimation of transcript abundances, and alignment-free comparison of sequencing data.
Pellow D, Filippova D, Kingsford C.
europepmc +5 more sources
Bloom Filters in Adversarial Environments [PDF]
ACM Transactions on Algorithms, 2019 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 ...
Naor, Moni, Yogev, Eylon
core +4 more sources
, 2013 A Bloom filter is a method for reducing the space (memory) required for representing a set by allowing a small error probability. In this paper we consider a \emph{Sliding Bloom Filter}: a data structure that, given a stream of elements, supports ...
Naor, Moni, Yogev, Eylon
core +2 more sources
Bloom filter variants for multiple sets: a comparative assessment [PDF]
Journal of Universal Computer Science, 2022 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 +3 more sources
Information Processing Letters, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Almeida, Paulo Sérgio +3 more
openaire +3 more sources
Quantum Bloom Filter and Its Applications
IEEE Transactions on Quantum Engineering, 2021 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