Results 11 to 20 of about 12,077 (255)
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
Privacy preserving record linkage meets record linkage using unencrypted data
International Journal of Population Data Science, 2018 Introduction Privacy preserving record linkage (PPRL) resolves privacy concerns because of its capabilities to link encrypted identifiers. It encrypts identifiers using bloom filters and performs record matching based on encrypted data using dice ...
Hesam Izakian
doaj +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
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
Content-Based Approach for Improving Bloom Filter Efficiency
Applied Sciences, 2023 Bloom filters are a type of data structure that is used to test whether or not an element is a member of a set. They are known for being space-efficient and are commonly employed in various applications, such as network routers, web browsers, and ...
Mohammed Alsuhaibani +3 more
doaj +1 more source
Counting With Tinytable: Every Bit Counts!
IEEE Access, 2019 Bloom filters are space efficient data structures that support approximate membership queries. They are easily extensible but incur significant overheads when extended to support additional functionality, such as removals or counting.
Gil Einziger, Roy Friedman
doaj +1 more source
Efficient Bloom Filter-Based Routing Protocol for Scalable Mobile Networks
Engineering Proceedings, 2023 Non-geographic routing protocols are inefficient when applied to large-scale mobile networks composed of hundreds of nodes. On the other hand, geographic routing protocols have the disadvantage of needing a location sensor.
Prabu S. +4 more
doaj +1 more source
Cryptanalysis of Basic Bloom Filters Used for Privacy Preserving Record Linkage
The Journal of Privacy and Confidentiality, 2014 Bloom filter encoded identifiers are increasingly used for privacy preserving record linkage applications, because they allow for errors in encrypted identifiers. However, little research on the security of Bloom filters has been published so far.
Frank Niedermeyer +3 more
doaj +1 more source