Bloom filter variants for multiple sets: a comparative assessment
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). With respect to the original data structure, both variants add the ability to store multiple subsets in t...
Main Authors: | Luca Calderoni, Dario Maio, Paolo Palmieri |
---|---|
Format: | Article |
Language: | English |
Published: |
Graz University of Technology
2022-02-01
|
Series: | Journal of Universal Computer Science |
Subjects: | |
Online Access: | https://lib.jucs.org/article/74230/download/pdf/ |
Similar Items
-
Evaluation of approximate comparison methods on Bloom filters for probabilistic linkage
by: Adrian P Brown, et al.
Published: (2019-05-01) -
Particle Filter for Randomly Delayed Measurements with Unknown Latency Probability
by: Ranjeet Kumar Tiwari, et al.
Published: (2020-10-01) -
BBF: Bloom Filter Variant for Blockchain
by: FAN Xing, NIU Baoning
Published: (2021-10-01) -
CRBF: Cross-Referencing Bloom-Filter-Based Data Integrity Verification Framework for Object-Based Big Data Transfer Systems
by: Preethika Kasu, et al.
Published: (2023-07-01) -
Dynamically Allocated Bloom Filter-Based PIT Architectures
by: Saeyoung Jang, et al.
Published: (2022-01-01)