Rehan Ullah Khan1, Ali Mustafa Qamar2,*, Suliman A. Alsuhibany2, Mohammed Alsuhaibani2
CMC-Computers, Materials & Continua, Vol.73, No.3, pp. 6037-6046, 2022, DOI:10.32604/cmc.2022.031626
Abstract Bloom filter (BF) is a space-and-time efficient probabilistic technique that helps answer membership queries. However, BF faces several issues. The problems with traditional BF are generally two. Firstly, a large number of false positives can return wrong content when the data is queried. Secondly, the large size of BF is a bottleneck in the speed of querying and thus uses large memory. In order to solve the above two issues, in this article, we propose the check bits concept. From the implementation perspective, in the check bits approach, before saving the content value in the BF, we obtain the binary… More >
Login
Register
