A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. In recent years, Bloom filters have increased in popularity in database and networking applications. A Bloom filter has two steps that called programming and membership query. In this paper, we introduce a new approach to integrate a hash table (HT) with Bloom filter to decrease the HT access time. This means that when a Bloom filter for an incoming item isdoi:10.5296/npa.v7i1.6240 fatcat:jxzskzrs35ea3o2g7kzyyltgx4