Network Applications of Bloom Filters: A Survey
From MaRDI portal
Publication:4672750
DOI10.1080/15427951.2004.10129096zbMath1090.68515OpenAlexW1993284846WikidataQ55980185 ScholiaQ55980185MaRDI QIDQ4672750
Andrei Z. Broder, Michael Mitzenmacher
Publication date: 3 May 2005
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2004.10129096
Related Items (34)
Support optimality and adaptive cuckoo filters ⋮ Dictionary Matching in a Stream ⋮ Scalable Bloom filters ⋮ Bloom Filters in Adversarial Environments ⋮ An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters ⋮ An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique ⋮ Efficient and robust associative memory from a generalized Bloom filter ⋮ Bloom filter-based secure data forwarding in large-scale cyber-physical systems ⋮ A new analysis of the false positive rate of a Bloom filter ⋮ Xor Filters ⋮ Optimizing static and adaptive probing schedules for rapid event detection ⋮ A cache architecture for counting bloom filters: theory and application ⋮ Improving counting Bloom filter performance with fingerprints ⋮ A novel server-side proxy caching strategy for large-scale multimedia applications ⋮ Less hashing, same performance: Building a better Bloom filter ⋮ Improving the performance of invertible Bloom lookup tables ⋮ Improving resource location with locally precomputed partial random walks ⋮ Dealing with Liars: Misbehavior Identification via Rényi-Ulam Games ⋮ Scaling metagenome sequence assembly with probabilistic de Bruijn graphs ⋮ Aggregate query processing in the presence of duplicates in wireless sensor networks ⋮ An index-split Bloom filter for deep packet inspection ⋮ Unnamed Item ⋮ On the false-positive rate of Bloom filters ⋮ Sampling for passive internet measurement: a review ⋮ Tight bounds for sliding Bloom filters ⋮ Index structures for fast similarity search for symbol strings ⋮ Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms ⋮ An Optimal Bloom Filter Replacement Based on Matrix Solving ⋮ Unnamed Item ⋮ Upper and lower bounds on black-box steganography ⋮ A symmetric cryptographic scheme for data integrity verification in cloud databases ⋮ A Survey of Data Structures in the Bitprobe Model ⋮ Adaptive Cuckoo Filters ⋮ A Theoretical Perspective on Hyperdimensional Computing
This page was built for publication: Network Applications of Bloom Filters: A Survey
