Results 11 to 20 of about 119,966 (182)
Redundant RFID Data Removing Algorithm Based on Dynamic-additional Bloom Filter [PDF]
Jisuanji kexue, 2021 The high redundancy generated by RFID devices in reading tag information will result in pressure of real-time transmission,waste of storage space and unreliable analysis results of upper application.To slove these problems,a dynamic-additional Bloom ...
DUAN Wen, ZHOU Liang
doaj +1 more source
Journal of Cheminformatics, 2023 AbstractUltra-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 set using either string or fingerprint representations.
Jorge Medina, Andrew D. White
openaire +4 more sources
BBF: Bloom Filter Variant for Blockchain
Jisuanji kexue yu tansuo, 2021 Bloom filter (BF) is highly efficient for membership queries, which is widely used in blockchain mem-bership queries. Aiming at the existing BFs do not exploit the data characteristics of blockchain and the features of modern processors, this paper ...
FAN Xing, NIU Baoning
doaj +1 more source
Evaluation Performance of Bloom Filter in Blockchain Network
Iraqi Journal of Information & Communication Technology, 2023 A blockchain is a secret, scalability and decentralized p2p network in which all nodes follow similar protocols, preventing any single node from controlling the basic structure.
Kilan M. Hussein, M.F. Al-Gailani
doaj +1 more source
L-rCBF: Learning-Based Key–Value Data Structure for Dynamic Data Processing
Applied Sciences, 2023 Learning-based data structures, such as a learned Bloom filter and a learned functional Bloom filter (L-FBF), have recently been proposed to replace traditional structures.
Yejee Lee, Hayoung Byun
doaj +1 more source
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
openaire +3 more sources
Access-efficient Balanced Bloom Filters [PDF]
2012 IEEE International Conference on Communications (ICC), 2012 Bloom Filters should particularly suit network devices, because of their low theoretical memory-access rates. However, in practice, since memory is often divided into blocks and Bloom Filters hash elements into several arbitrary memory blocks, Bloom Filters actually need high memory-access rates.
Kanizo Y., Hay D., Keslassy I.
openaire +1 more source
A Cuckoo Filter Modification Inspired by Bloom Filter [PDF]
AUT Journal of Electrical Engineering, 2019 Probabilistic data structures are so popular in membership queries, network applications, and so on. Bloom Filter and Cuckoo Filter are two popular space efficient models that incorporate in set membership checking part of many important protocols.
Hananeh Sasaniyan Asl +2 more
doaj +1 more source
Fully pipelined bloom filter architecture [PDF]
, 2008 Recently, we proposed a two-stage pipelined Bloom filter architecture to save power for network security applications. In this letter, we generalize the pipelined Bloom filter architecture to k-stage and show that significant power savings can be ...
Koçak, T, Paynter, M
core +2 more sources