rFilter: A Scalable and Space-efficient Membership Filter

In this paper, we present a probabilistic data structure for membership filter, called rFilter. The rFilter is an extension of the Bloom filter data structure. The rFilter is a simple, yet powerful membership filter among its kind. The rFilter requires constant time and very low space complexity. In addition, the rFilter is highly scalable and space-efficient as compared to other variants of Bloom filter. The rFilter avoids complex hashing overhead. The rFilter boosts up the space performance by 16× or 93.75% over integer representation of an array. Besides, the rFilter reduces 4× or 75% over character representation of an array. Moreover, the rFilter drastically reduces the chances of "false positive" over the conventional method.

[1]  Pedro Reviriego,et al.  Single Event Transient Tolerant Bloom Filter Implementations , 2017, IEEE Transactions on Computers.

[2]  Changyu Dong,et al.  When private set intersection meets big data: an efficient and scalable protocol , 2013, CCS.

[3]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[4]  Páll Melsted,et al.  Efficient counting of k-mers in DNA sequences using a bloom filter , 2011, BMC Bioinformatics.

[5]  Ernst W. Biersack,et al.  Tree-structured Bloom Filters for Joint Optimization of False Positive Probability and Transmission Bandwidth , 2015, SIGMETRICS.

[6]  Hyesook Lim,et al.  On Reducing False Positives of a Bloom Filter in Trie-Based Algorithms , 2015 .

[7]  Faisal Karim Shaikh,et al.  Bloom filter based data collection algorithm for wireless sensor networks , 2017, 2017 International Conference on Information Networking (ICOIN).

[8]  Peter Sanders,et al.  Cache-, hash-, and space-efficient bloom filters , 2009, JEAL.

[9]  Bin Fan,et al.  Cuckoo Filter: Practically Better Than Bloom , 2014, CoNEXT.

[10]  Zhiyang Li,et al.  An Efficient DDoS Detection with Bloom Filter in SDN , 2016, 2016 IEEE Trustcom/BigDataSE/ISPA.

[11]  Hyesook Lim,et al.  Ternary Bloom Filter Replacing Counting Bloom Filter , 2017, IEEE Communications Letters.

[12]  Isaac Keslassy,et al.  The Bloom paradox: When not to use a Bloom filter? , 2012, INFOCOM.

[13]  Evaggelia Pitoura,et al.  One is enough: distributed filtering for duplicate elimination , 2011, CIKM '11.

[14]  Michael A. Bender,et al.  Don't Thrash: How to Cache Your Hash on Flash , 2011, Proc. VLDB Endow..

[15]  Michael Mitzenmacher,et al.  Compressed bloom filters , 2001, PODC '01.

[16]  S. Murugeswari,et al.  A partition based bloom filter for fastest data search , 2016, 2016 International Conference on Advanced Communication Control and Computing Technologies (ICACCCT).

[17]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[18]  Roy Friedman,et al.  TinySet - An Access Efficient Self Adjusting Bloom Filter Construction , 2015, 2015 24th International Conference on Computer Communication and Networks (ICCCN).

[19]  Hyoung-Joo Kim,et al.  Join processing using Bloom filter in MapReduce , 2012, RACS.

[20]  Alberto Del Bimbo,et al.  Bloom Filters and Compact Hash Codes for Efficient and Distributed Image Retrieval , 2016, 2016 IEEE International Symposium on Multimedia (ISM).

[21]  Leon M. Tolbert,et al.  kBF: Towards Approximate and Bloom Filter based Key-Value Storage for Cloud Computing Systems , 2017, IEEE Transactions on Cloud Computing.

[22]  Moni Naor,et al.  Tight Bounds for Sliding Bloom Filters , 2013, Algorithmica.

[23]  David Hutchison,et al.  Scalable Bloom Filters , 2007, Inf. Process. Lett..