TinySet - An access efficient self adjusting bloom filter construction

Gil Einziger, Roy Friedman

Research output: Contribution to journalArticlepeer-review

29 Scopus citations


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 supports removals. TinySet is mathematically analyzed and extensively tested and is shown to be fast and more space efficient than a variety of Bloom filter variants. TinySet also has low sensitivity to configuration parameters and is therefore more flexible than a Bloom filter.

Original languageEnglish
Article number7892017
Pages (from-to)2295-2307
Number of pages13
JournalIEEE/ACM Transactions on Networking
Issue number4
StatePublished - 1 Aug 2017
Externally publishedYes


  • Approximate set membership
  • Bloom filters
  • hash tables

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'TinySet - An access efficient self adjusting bloom filter construction'. Together they form a unique fingerprint.

Cite this