Proceedings ArticleDOI
Modifications using Circular Shift for a Better Bloom Filter
Myeong-Kyu Kim,Sung-Ryul Kim +1 more
- pp 149-154
TLDR
This work proposes a system that uses less computation than previous works with similar false positive rate and which is implemented by using a circular bit shift and computes faster than previous studies with similarfalse positive rate.Abstract:
The Bloom filter is a hash-based data structure that facilitates membership querying. Computation speed of Bloom filter is affected by hash functions that produce hash outputs. Basically, two operations: 'add' and 'query', consists of the Bloom filter. Previous researches have shown advanced computation speed of Bloom filter since the standard Bloom Filter is published. For example, Double Hash Bloom filter, Single Hash Bloom filter, etc.We propose a system that uses less computation than previous works with similar false positive and which is implemented by using a circular bit shift. This method was implemented with faster calculation speed, compared with previous works. Furthermore, experiments which were compared with previous researches and standard Bloom filter. Therefore, we demonstrate that the proposed system computes faster than previous studies with similar false positive rate.read more
References
More filters
Journal ArticleDOI
Space/time trade-offs in hash coding with allowable errors
TL;DR: Analysis of the paradigm problem demonstrates that allowing a small number of test messages to be falsely identified as members of the given set will permit a much smaller hash area to be used without increasing reject time.
The Art in Computer Programming
Andrew Hunt,Dave Thomas +1 more
TL;DR: Here the authors haven’t even started the project yet, and already they’re forced to answer many questions: what will this thing be named, what directory will it be in, what type of module is it, how should it be compiled, and so on.
Journal ArticleDOI
Network Applications of Bloom Filters: A Survey
TL;DR: The aim of this paper is to survey the ways in which Bloom filters have been used and modified in a variety of network problems, with the aim of providing a unified mathematical and practical framework for understanding them and stimulating their use in future applications.
Book ChapterDOI
Less hashing, same performance: building a better bloom filter
Adam Kirsch,Michael Mitzenmacher +1 more
TL;DR: Only two hash functions are necessary to effectively implement a Bloom filter without any loss in the asymptotic false positive probability, leading to less computation and potentially less need for randomness in practice.