Bloom's Filters : Their Types and Analysis



In this paper we discuss Bloom filter in its original form and the varieties of its extensions. A Bloom filter is a randomized data-structure for concisely representing a set in order to support approximate membership queries. Although it was devised in 1970 for the purpose of spell checking, it was seldom used except in database optimization. In recent years, it has been rediscovered by the networking community, and has become a key component in many networking systems applications. In this paper, we will examine and analyse the different types of this filter.

Anahtar Kelimeler

Bloom Filter; Data Structure

Tam Metin:

PDF (English)


İndekslendiği Kaynaklar


Listeleyen Diğer Kaynaklar ve Servisler



Creative Commons Lisansı
Doğuş Üniversitesi Dergisi'nin içeriği Creative Commons Atıf-Gayriticari 4.0 Uluslararası Lisansı ile lisanslanmıştır.


Doğuş Üniversitesi Dergisi
Acıbadem Zeamet Sokak, No: 21
34722 - Kadıköy, İSTANBUL