TinySet - An access efficient self adjusting bloom filter construction

Gil Einziger; Roy Friedman

doi:10.1109/ICCCN.2015.7288476

TinySet - An access efficient self adjusting bloom filter construction

Gil Einziger, Roy Friedman

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	24th International Conference on Computer Communications and Networks, ICCCN 2015
Publisher	Institute of Electrical and Electronics Engineers
ISBN (Electronic)	9781479999644
DOIs	https://doi.org/10.1109/ICCCN.2015.7288476
State	Published - 2 Oct 2015
Externally published	Yes
Event	24th International Conference on Computer Communications and Networks, ICCCN 2015 - Las Vegas, United States Duration: 3 Aug 2015 → 6 Aug 2015

Publication series

Name	Proceedings - International Conference on Computer Communications and Networks, ICCCN
Volume	2015-October
ISSN (Print)	1095-2055

Conference

Conference	24th International Conference on Computer Communications and Networks, ICCCN 2015
Country/Territory	United States
City	Las Vegas
Period	3/08/15 → 6/08/15

ASJC Scopus subject areas

Computer Networks and Communications
Hardware and Architecture
Software

Access to Document

10.1109/ICCCN.2015.7288476

Cite this

Einziger, G., & Friedman, R. (2015). TinySet - An access efficient self adjusting bloom filter construction. In 24th International Conference on Computer Communications and Networks, ICCCN 2015 Article 7288476 (Proceedings - International Conference on Computer Communications and Networks, ICCCN; Vol. 2015-October). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ICCCN.2015.7288476

@inproceedings{6a2eebf4e4cb4d7fae437abfdd351a22,

title = "TinySet - An access efficient self adjusting bloom filter construction",

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.",

author = "Gil Einziger and Roy Friedman",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 24th International Conference on Computer Communications and Networks, ICCCN 2015 ; Conference date: 03-08-2015 Through 06-08-2015",

year = "2015",

month = oct,

day = "2",

doi = "10.1109/ICCCN.2015.7288476",

language = "English",

series = "Proceedings - International Conference on Computer Communications and Networks, ICCCN",

publisher = "Institute of Electrical and Electronics Engineers",

booktitle = "24th International Conference on Computer Communications and Networks, ICCCN 2015",

address = "United States",

}

Einziger, G & Friedman, R 2015, TinySet - An access efficient self adjusting bloom filter construction. in 24th International Conference on Computer Communications and Networks, ICCCN 2015., 7288476, Proceedings - International Conference on Computer Communications and Networks, ICCCN, vol. 2015-October, Institute of Electrical and Electronics Engineers, 24th International Conference on Computer Communications and Networks, ICCCN 2015, Las Vegas, United States, 3/08/15. https://doi.org/10.1109/ICCCN.2015.7288476

TinySet - An access efficient self adjusting bloom filter construction. / Einziger, Gil; Friedman, Roy.
24th International Conference on Computer Communications and Networks, ICCCN 2015. Institute of Electrical and Electronics Engineers, 2015. 7288476 (Proceedings - International Conference on Computer Communications and Networks, ICCCN; Vol. 2015-October).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - TinySet - An access efficient self adjusting bloom filter construction

AU - Einziger, Gil

AU - Friedman, Roy

PY - 2015/10/2

Y1 - 2015/10/2

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84959418893&partnerID=8YFLogxK

U2 - 10.1109/ICCCN.2015.7288476

DO - 10.1109/ICCCN.2015.7288476

M3 - Conference contribution

AN - SCOPUS:84959418893

T3 - Proceedings - International Conference on Computer Communications and Networks, ICCCN

BT - 24th International Conference on Computer Communications and Networks, ICCCN 2015

PB - Institute of Electrical and Electronics Engineers

T2 - 24th International Conference on Computer Communications and Networks, ICCCN 2015

Y2 - 3 August 2015 through 6 August 2015

ER -

TinySet - An access efficient self adjusting bloom filter construction

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this