<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Hunting the Pertinency of Bloom Filter in Computer Networking and Beyond: A Survey</title>
  </titleInfo>
  <name type="personal">
    <namePart>Ripon Patgiri</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
    <role>
      <roleTerm type="text">author.</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Sabuzima Nayak</namePart>
    <role>
      <roleTerm type="text">author.</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Samir Kumar Borgohain</namePart>
    <role>
      <roleTerm type="text">author.</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="">Journal articles.</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">xx</placeTerm>
    </place>
    <dateIssued encoding="marc">2019</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <extent>1 online resource (1 article).</extent>
  </physicalDescription>
  <abstract>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.</abstract>
  <note type="statement of responsibility">Ripon Patgiri; Sabuzima Nayak; Samir Kumar Borgohain.</note>
  <note>Publication type: Journal article.</note>
  <note>Linked open-access copy: published version.</note>
  <note>Open access; no subscription required for the linked open-access version. Unrestricted online access star</note>
  <note xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://openalex.org/W2912806937">Creative Commons Attribution (licence family recorded by the source; version not supplied in metadata). https://openalex.org/W2912806937</note>
  <note>In English.</note>
  <subject>
    <topic>Bloom filter</topic>
  </subject>
  <subject>
    <topic>probabilistic data structures</topic>
  </subject>
  <subject>
    <topic>membership testing</topic>
  </subject>
  <subject>
    <topic>set membership</topic>
  </subject>
  <subject>
    <topic>memory overhead</topic>
  </subject>
  <subject>
    <topic>scalability</topic>
  </subject>
  <subject>
    <topic>B. Sc. Computer Science</topic>
  </subject>
  <subject>
    <topic>UMUN open access collection</topic>
  </subject>
  <subject>
    <topic>computer networks</topic>
  </subject>
  <relatedItem type="host">
    <titleInfo>
      <title>Journal of Computer Networks and Communications</title>
    </titleInfo>
    <identifier type="issn">2090-7141</identifier>
    <part>
      <text>Vol. 2019, (2019), pages/article 1-10</text>
    </part>
  </relatedItem>
  <identifier type="uri">https://downloads.hindawi.com/journals/jcnc/2019/2712417.pdf</identifier>
  <location>
    <url displayLabel="Read open-access publication">https://downloads.hindawi.com/journals/jcnc/2019/2712417.pdf</url>
  </location>
  <accessCondition type="restrictionOnAccess">Open access; no subscription required for the linked open-access version.</accessCondition>
  <accessCondition type="useAndReproduction">Creative Commons Attribution (licence family recorded by the source; version not supplied in metadata).</accessCondition>
  <recordInfo>
    <recordContentSource authority="marcorg">local</recordContentSource>
    <recordCreationDate encoding="marc">261005</recordCreationDate>
    <recordChangeDate encoding="iso8601">20261005174813.0</recordChangeDate>
    <recordIdentifier source="local">UMUN-OA-20261005-CS-060</recordIdentifier>
    <languageOfCataloging>
      <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
    </languageOfCataloging>
  </recordInfo>
</mods>
