Results 11 to 20 of about 2,234,842 (311)
Bloom filters for molecules [PDF]
Journal of Cheminformatics, 2023 Ultra-large chemical libraries are reaching 10s to 100s of billions of molecules. A challenge for these libraries is to efficiently check if a proposed molecule is present. Here we propose and study Bloom filters for testing if a molecule is present in a
Jorge Medina, Andrew D. White
doaj +8 more sources
A blinded evaluation of privacy preserving record linkage with Bloom filters [PDF]
BMC Medical Research Methodology, 2022 Background Privacy preserving record linkage (PPRL) methods using Bloom filters have shown promise for use in operational linkage settings. However real-world evaluations are required to confirm their suitability in practice.
Sean Randall +6 more
doaj +3 more sources
Information Processing Letters, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Hutchison +2 more
exaly +8 more sources
On the Privacy of Counting Bloom Filters
IEEE Transactions on Dependable and Secure Computing, 2023 Bloom filters are widely used in networking and computing to accelerate membership checking. In many applications filters store sensitive data, so their privacy is of primary concern. At first glance, it seems that extracting the set of elements inserted from the filter would not be possible, because in Bloom filters elements are mapped to positions ...
Shanshan Liu +2 more
exaly +4 more sources
Bloofi: Multidimensional Bloom filters [PDF]
Information Systems, 2015 Bloom filters are probabilistic data structures commonly used for approximate membership problems in many areas of Computer Science (networking, distributed systems, databases, etc.). With the increase in data size and distribution of data, problems arise where a large number of Bloom filters are available, and all them need to be searched for ...
Adina Crainiceanu, Daniel Lemire
exaly +6 more sources
A Case for Partitioned Bloom Filters [PDF]
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).
Paulo Sérgio Almeida +1 more
core +5 more sources
Evaluation of approximate comparison methods on Bloom filters for probabilistic linkage [PDF]
International Journal of Population Data Science, 2019 Introduction The need for increased privacy protection in data linkage has driven the development of privacy-preserving record linkage (PPRL) techniques.
Adrian P Brown +3 more
doaj +2 more sources
Adaptive one memory access bloom filters [PDF]
IEEE Transactions on Network and Service Management, 2022 Bloom filters are widely used to perform fast approximate membership checking in networking applications. The main limitation of Bloom filters is that they suffer from false positives that can only be reduced by using more memory.
Rottenstreich, Ori +3 more
core +2 more sources
aKmerBroom: Ancient oral DNA decontamination using Bloom filters on k-mer sets [PDF]
iScience, 2023 Summary: Dental calculus samples are modeled as a mixture of DNA coming from dental plaque and contaminants. Current computational decontamination methods such as Recentrifuge and DeconSeq require either a reference database or sequenced negative ...
Camila Duitama González +4 more
doaj +2 more sources
Stable learned bloom filters for data streams
Proceedings of the VLDB Endowment, 2020 Bloom filter and its variants are elegant space-efficient probabilistic data structures for approximate set membership queries. It has been recently shown that the space cost of Bloom filters can be significantly reduced via a combination with pre ...
Zheng, Libin +3 more
core +2 more sources