Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal Perfecting a Video Game with Game Metrics
Andri Hidayat
Bogor Agricultural University, Indonesia
Computer Science & IT

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Bloom Filter Implementation in Cache with Low Level of False Positive Andri Hidayat; Fahren Bukhari; Heru Sukoco
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 4: December 2017
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v15i4.4447

Abstract

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.
Co-Authors Fahren Bukhari Heru Sukoco