TY - GEN AU - Ripon Patgiri AU - Sabuzima Nayak AU - Samir Kumar Borgohain TI - Hunting the Pertinency of Bloom Filter in Computer Networking and Beyond: A Survey PY - 2019/// CY - [Place of publication not identified] PB - Hindawi Publishing Corporation KW - Bloom filter KW - probabilistic data structures KW - membership testing KW - set membership KW - memory overhead KW - scalability KW - B. Sc. Computer Science KW - UMUN open access collection KW - computer networks KW - Journal articles N1 - Publication type: Journal article; Linked open-access copy: published version; Open access; no subscription required for the linked open-access version N2 - 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 UR - https://downloads.hindawi.com/journals/jcnc/2019/2712417.pdf ER -