Abstract- Even though the bloom filter has got a false positive, it is widely impemented because of its compactness and O(1) time complexity; however; if we want to save keys from the different location into bloom filter, the bloom filter can not differentiate the location of keys that have been entered. to overcome this problem, researcher proposes to concatenate the key and its location identifier before saving it into the bloom filter. meanwhile, this paper proposes to solve this problem by hashing the key and its location identifier separately, and then converting the hash code to the bit position of the bloom filter, after that merging the value of the bit position of the key and its location identifier. based on the experiment, proposed bloom filter outperfoms the previous research in term of the computation time while the false positive rate is not significantly different.