Bloom Filter Implementation in Cache with Low Level of False Positive

Andri Hidayat, Fahren Bukhari, Heru Sukoco


Searching techniques significantly determine the speed of getting the information or objects. Finding an object in a set is related to membership checking. In the case of massive data, it needs an appropriate technique to search an object accurately and faster. This research implements searching methods, namely Bloom Filter and Sequential Search algorithms, to find objects in a set of data. It aims to improve our system getting a proper item. Due to the possibility of False-Positive existence as a result of Bloom filter technique, there is a potentially inaccurate representation to object sought. Some parameters are influencing False-Positive, namely the number of objects, available bits, and the number of mapped-bit. A Combination of those parameters could decrease the level of False-Positive and improve their accuracy and faster accessibility. In this research, we use three data object variations with the biggest object size of  2000000. Cached objects used in our experiments is between 2 – 20% of variation from the generated objects. The best results with the lowest False-Positive is a combination of bit = 8, mapped bit = 7, and 6% of cache size from 2000000 generated objects.


bloom filter, false positive, sequential search, membership object

Full Text:



Article Metrics

Abstract view : 180 times
PDF - 231 times


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

TELKOMNIKA Telecommunication, Computing, Electronics and Control
ISSN: 1693-6930, e-ISSN: 2302-9293
Universitas Ahmad Dahlan, 4th Campus, 9th Floor, LPPI Room
Jl. Ringroad Selatan, Kragilan, Tamanan, Banguntapan, Bantul, Yogyakarta, Indonesia 55191
Phone: +62 (274) 563515, 511830, 379418, 371120 ext. 4902, Fax: +62 274 564604