TinySet—An Access Efficient Self Adjusting Bloom Filter Construction

@article{Einziger2017TinySetAnAE,
  title={TinySet—An Access Efficient Self Adjusting Bloom Filter Construction},
  author={Gil Einziger and Roy Friedman},
  journal={IEEE/ACM Transactions on Networking},
  year={2017},
  volume={25},
  pages={2295-2307}
}
Bloom filters are a very popular and efficient data structure for approximate set membership queries. However, Bloom filters have several key limitations as they require 44% more space than the lower bound, their operations access multiple memory words, and they do not support removals. This paper presents TinySet, an alternative Bloom filter construction that is more space efficient than Bloom filters for false positive rates smaller than 2.8%, accesses only a single memory word and partially… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

OMASS: One Memory Access Set Separation

IEEE Transactions on Knowledge and Data Engineering • 2016
View 3 Excerpts
Highly Influenced

Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free

IEEE INFOCOM 2018 - IEEE Conference on Computer Communications • 2018
View 1 Excerpt

rFilter: A Scalable and Space-efficient Membership Filter

2018 5th International Conference on Signal Processing and Integrated Networks (SPIN) • 2018
View 1 Excerpt

Poster abstract: A sliding counting bloom filter

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) • 2017
View 1 Excerpt

TinyCache - An Effective Cache Admission Filter

GLOBECOM 2017 - 2017 IEEE Global Communications Conference • 2017
View 4 Excerpts

Counting with TinyTable: Every bit counts!

2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) • 2015
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Rank-indexed hashing: A compact construction of Bloom filters and variants

2008 IEEE International Conference on Network Protocols • 2008
View 5 Excerpts
Highly Influenced

Access-efficient Balanced Bloom Filters

2012 IEEE International Conference on Communications (ICC) • 2012
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…