An optimal bloom filter replacement
From MaRDI portal
Recommendations
Cited in
(50)- XOR-satisfiability set membership filters
- Certifying certainty and uncertainty in approximate membership query structures
- On the analysis of Bloom filters
- Improving the performance of invertible Bloom lookup tables
- Compressed string dictionary search with edit distance one
- Compressed Bloom filters
- A Survey of Data Structures in the Bitprobe Model
- Sliding Bloom Filters
- Optimizing data popularity conscious Bloom filters
- An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters
- An Optimal Bloom Filter Replacement Based on Matrix Solving
- Constructing SAT filters with a quantum annealer
- Less hashing, same performance: Building a better Bloom filter
- Bloomier Filters: A Second Look
- Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters
- scientific article; zbMATH DE number 1982202 (Why is no real title available?)
- Distance sensitive Bloom filters without false negatives
- Network Applications of Bloom Filters: A Survey
- M-balance matrix Bloom filter
- A new data redundancy elimination algorithm based on Bloom filter data structure
- scientific article; zbMATH DE number 1875424 (Why is no real title available?)
- Inferring insertion times and optimizing error penalties in time-decaying Bloom filters
- A theoretical perspective on hyperdimensional computing
- An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique
- Binary fuse filters: fast and smaller than xor filters
- An optimization problem related to Bloom filters with bit patterns
- Bloom maps
- Distance-Sensitive Bloom Filters
- Conjunctive filter: breaking the entropy barrier
- Approximate range emptiness in constant time and optimal space
- Cuckoo filter: simplification and analysis
- Fast Evaluation of Union-Intersection Expressions
- Cache-, hash-, and space-efficient bloom filters
- A space lower bound for dynamic approximate membership data structures
- Less Hashing, Same Performance: Building a Better Bloom Filter
- An Improved Construction for Counting Bloom Filters
- Tight bounds for sliding Bloom filters
- Xor Filters
- Dynamic dictionaries for multisets and counting filters with constant time operations
- Encapsulated search index: public-key, sub-linear, distributed, and delegatable
- Bet-or-pass: adversarially robust Bloom filters
- Succinct filters for sets of unknown sizes
- Daisy Bloom filters
- Dynamic filter and retrieval with one access to modifiable memory
- Dynamic dictionaries for multisets and counting filters with constant time operations
- Support optimality and adaptive cuckoo filters
- Scalable Bloom filters
- Improving counting Bloom filter performance with fingerprints
- On the false-positive rate of Bloom filters
- Deterministic \(k\)-set structure
This page was built for publication: An optimal bloom filter replacement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921747)
