TinySet - An access efficient self adjusting bloom filter construction

Gil Einziger, Roy Friedman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

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 work 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
Title of host publication24th International Conference on Computer Communications and Networks, ICCCN 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479999644
DOIs
StatePublished - 2 Oct 2015
Externally publishedYes
Event24th International Conference on Computer Communications and Networks, ICCCN 2015 - Las Vegas, United States
Duration: 3 Aug 20156 Aug 2015

Publication series

NameProceedings - International Conference on Computer Communications and Networks, ICCCN
Volume2015-October
ISSN (Print)1095-2055

Conference

Conference24th International Conference on Computer Communications and Networks, ICCCN 2015
Country/TerritoryUnited States
CityLas Vegas
Period3/08/156/08/15

Fingerprint

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

Cite this