000 03173naa a22005297i 4500
001 UMUN-OA-20261005-CS-060
003 local
005 20261005174813.0
006 m o d
007 cr||||||||||||
008 261005s2019 xx o u000 0 eng d
024 7 _a10.1155/2019/2712417
_2doi
035 _a(local)OpenAlex:W2912806937
040 _alocal
_beng
_clocal
041 0 _aeng
100 0 _aRipon Patgiri
_eauthor.
245 1 0 _aHunting the Pertinency of Bloom Filter in Computer Networking and Beyond: A Survey /
_cRipon Patgiri; Sabuzima Nayak; Samir Kumar Borgohain.
264 1 _a[Place of publication not identified] :
_bHindawi Publishing Corporation,
_c2019.
300 _a1 online resource (1 article).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
500 _aPublication type: Journal article.
500 _aLinked open-access copy: published version.
506 0 _aOpen access; no subscription required for the linked open-access version.
_fUnrestricted online access
_2star
520 3 _aBloom 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.
540 _aCreative Commons Attribution (licence family recorded by the source; version not supplied in metadata).
_uhttps://openalex.org/W2912806937
546 _aIn English.
588 0 _aDescription generated from OpenAlex bibliographic metadata retrieved on 5 October 2026; full text linked from the source.
590 _aCourse allocation: B. Sc. Computer Science.
650 4 _aBloom filter
650 4 _aprobabilistic data structures
650 4 _amembership testing
650 4 _aset membership
650 4 _amemory overhead
650 4 _ascalability
653 _aB. Sc. Computer Science
653 _aUMUN open access collection
653 _acomputer networks
655 4 _aJournal articles.
700 0 _aSabuzima Nayak
_eauthor.
700 0 _aSamir Kumar Borgohain
_eauthor.
773 0 _tJournal of Computer Networks and Communications
_gVol. 2019, (2019), pages/article 1-10
_x2090-7141
856 4 0 _uhttps://downloads.hindawi.com/journals/jcnc/2019/2712417.pdf
_yRead open-access publication
_zOpen access. Access and licence reported by the source; this host could not be independently checked by automation.
_70
884 _aCourse selection and automated MARC21 enrichment from OpenAlex metadata.
_g20261005
_khttps://openalex.org/W2912806937
_qlocal
942 _n0
999 _c422
_d422