scientific article; zbMATH DE number 6469129
From MaRDI portal
Publication:5501239
Recommendations
- Cache-, hash-, and space-efficient bloom filters
- Improving the performance of invertible Bloom lookup tables
- The power of 1 + for memory-efficient Bloom filters
- A cache architecture for counting bloom filters: theory and application
- Scalable Bloom filters
- Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
- Optimal Bloom filters and adaptive merging for LSM-trees
- On the analysis of Bloom filters
Cited in
(24)- Modified binary searching for static tables
- CuCoTrack: cuckoo filter based connection tracking
- Hardness of peeling with stashes
- Compressed string dictionary search with edit distance one
- scientific article; zbMATH DE number 1629858 (Why is no real title available?)
- An optimal bloom filter replacement
- Minimal and monotone minimal perfect hash functions
- An Optimal Bloom Filter Replacement Based on Matrix Solving
- Spatial Bloom filters: enabling privacy in location-aware applications
- Bloomier Filters: A Second Look
- An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique
- scientific article; zbMATH DE number 7525476 (Why is no real title available?)
- Constant-time retrieval with O( m) extra bits
- Binary fuse filters: fast and smaller than xor filters
- Bloom maps
- Cache-, hash-, and space-efficient bloom filters
- A space lower bound for dynamic approximate membership data structures
- An Improved Construction for Counting Bloom Filters
- Xor Filters
- Adaptive Cuckoo Filters
- Dynamic filter and retrieval with one access to modifiable memory
- Ribbon: fast succinct static retrieval and approximate membership
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions
- Scalable Bloom filters
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501239)
