Ripon Patgiri

Hunting the Pertinency of Bloom Filter in Computer Networking and Beyond: A Survey / Ripon Patgiri; Sabuzima Nayak; Samir Kumar Borgohain. - 1 online resource (1 article).

Publication type: Journal article. Linked open-access copy: published version.

Open access; no subscription required for the linked open-access version.

Bloom filter is a probabilistic data structure to filter a membership of a set. Bloom filter returns “true” or “false” with an error tolerance depending on the presence of the element in the set. Bloom filter is used to boost up the performance of a system using small space overhead. It is extensively used since its inception. The Bloom filter has met wide area of applications. Bloom filter is used in entire computing field irrespective of application and research domain. Bloom filter poses (i) high adaptability, (ii) low memory space overhead as compared to hashing algorithms, (iii) high scalability, and (iv) high performance. In this article, we uncover the application area of Bloom filter in computer networking and its related domain.


Creative Commons Attribution (licence family recorded by the source; version not supplied in metadata).


In English.

10.1155/2019/2712417 doi


Bloom filter
probabilistic data structures
membership testing
set membership
memory overhead
scalability

B. Sc. Computer Science UMUN open access collection computer networks


Journal articles.