<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>03173naa a22005297i 4500</leader>
  <controlfield tag="001">UMUN-OA-20261005-CS-060</controlfield>
  <controlfield tag="003">local</controlfield>
  <controlfield tag="005">20261005174813.0</controlfield>
  <controlfield tag="006">m     o  d        </controlfield>
  <controlfield tag="007">cr||||||||||||</controlfield>
  <controlfield tag="008">261005s2019    xx      o    u000 0 eng d</controlfield>
  <datafield tag="024" ind1="7" ind2=" ">
    <subfield code="a">10.1155/2019/2712417</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
    <subfield code="a">(local)OpenAlex:W2912806937</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">local</subfield>
    <subfield code="b">eng</subfield>
    <subfield code="c">local</subfield>
  </datafield>
  <datafield tag="041" ind1="0" ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="100" ind1="0" ind2=" ">
    <subfield code="a">Ripon Patgiri</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Hunting the Pertinency of Bloom Filter in Computer Networking and Beyond: A Survey /</subfield>
    <subfield code="c">Ripon Patgiri; Sabuzima Nayak; Samir Kumar Borgohain.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">[Place of publication not identified] :</subfield>
    <subfield code="b">Hindawi Publishing Corporation,</subfield>
    <subfield code="c">2019.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">1 online resource (1 article).</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text</subfield>
    <subfield code="b">txt</subfield>
    <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="a">computer</subfield>
    <subfield code="b">c</subfield>
    <subfield code="2">rdamedia</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">online resource</subfield>
    <subfield code="b">cr</subfield>
    <subfield code="2">rdacarrier</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Publication type: Journal article.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Linked open-access copy: published version.</subfield>
  </datafield>
  <datafield tag="506" ind1="0" ind2=" ">
    <subfield code="a">Open access; no subscription required for the linked open-access version.</subfield>
    <subfield code="f">Unrestricted online access</subfield>
    <subfield code="2">star</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">Bloom filter is a probabilistic data structure to filter a membership of a set. Bloom filter returns &#x201C;true&#x201D; or &#x201C;false&#x201D; 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.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Creative Commons Attribution (licence family recorded by the source; version not supplied in metadata).</subfield>
    <subfield code="u">https://openalex.org/W2912806937</subfield>
  </datafield>
  <datafield tag="546" ind1=" " ind2=" ">
    <subfield code="a">In English.</subfield>
  </datafield>
  <datafield tag="588" ind1="0" ind2=" ">
    <subfield code="a">Description generated from OpenAlex bibliographic metadata retrieved on 5 October 2026; full text linked from the source.</subfield>
  </datafield>
  <datafield tag="590" ind1=" " ind2=" ">
    <subfield code="a">Course allocation: B. Sc. Computer Science.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">Bloom filter</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">probabilistic data structures</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">membership testing</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">set membership</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">memory overhead</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">scalability</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">B. Sc. Computer Science</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">UMUN open access collection</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">computer networks</subfield>
  </datafield>
  <datafield tag="655" ind1=" " ind2="4">
    <subfield code="a">Journal articles.</subfield>
  </datafield>
  <datafield tag="700" ind1="0" ind2=" ">
    <subfield code="a">Sabuzima Nayak</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="700" ind1="0" ind2=" ">
    <subfield code="a">Samir Kumar Borgohain</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
    <subfield code="t">Journal of Computer Networks and Communications</subfield>
    <subfield code="g">Vol. 2019, (2019), pages/article 1-10</subfield>
    <subfield code="x">2090-7141</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
    <subfield code="u">https://downloads.hindawi.com/journals/jcnc/2019/2712417.pdf</subfield>
    <subfield code="y">Read open-access publication</subfield>
    <subfield code="z">Open access. Access and licence reported by the source; this host could not be independently checked by automation.</subfield>
    <subfield code="7">0</subfield>
  </datafield>
  <datafield tag="884" ind1=" " ind2=" ">
    <subfield code="a">Course selection and automated MARC21 enrichment from OpenAlex metadata.</subfield>
    <subfield code="g">20261005</subfield>
    <subfield code="k">https://openalex.org/W2912806937</subfield>
    <subfield code="q">local</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="n">0</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">422</subfield>
    <subfield code="d">422</subfield>
  </datafield>
</record>
