Distributed Dynamic Cuckoo Filter System Based on Redis Cluster

With the exponential growth of network data storage scale, the issue of uniform distribution and efficient retrieval of data in the distributed storage systems such as the Redis cluster has received increasing attention in recent years. In view of the existing problems in scalability, usability and other aspects of the solution in the current research, we propose the Distributed Dynamic Cuckoo Filter system based on Redis cluster. On the one hand, we introduce an efficient hash index structure—Dynamic Cuckoo Filter, which only stores the fingerprint information of data, and automatically scalable capacity to meet the demand of data storage on a dynamic scale. On the other hand, we use the consistent hashing algorithm to construct Redis cluster, and use the thorough communication mechanism of Redis cluster to achieve the data sharing and efficient utilization of multi-machine filters. The scheme proposed in this paper can take the time and space efficiency into account, greatly improve the retrieval performance of massive data, and improve the reliability and availability of Redis cluster.

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

[2]  Feng Wang,et al.  Enhancing Dynamic Packet Filtering Technique with d-Left Counting Bloom Filter Algorithm , 2009, 2009 Second International Conference on Intelligent Networks and Intelligent Systems.

[3]  Jie Wu,et al.  The dynamic cuckoo filter , 2017, 2017 IEEE 25th International Conference on Network Protocols (ICNP).

[4]  Qiang Li,et al.  A data placement strategy based on clustering and consistent hashing algorithm in cloud computing , 2014, 9th International Conference on Communications and Networking in China.

[5]  Michael Mitzenmacher,et al.  Less Hashing, Same Performance: Building a Better Bloom Filter , 2006, ESA.

[6]  George Varghese,et al.  An Improved Construction for Counting Bloom Filters , 2006, ESA.

[7]  Jie Wu,et al.  The Dynamic Bloom Filters , 2010, IEEE Transactions on Knowledge and Data Engineering.

[8]  Hans-Jörg Schek,et al.  Foundations of Data Organization and Algorithms , 1989, Lecture Notes in Computer Science.

[9]  Gang Wang,et al.  K-Divided Bloom Filter Algorithm and Its Analysis , 2007, Future Generation Communication and Networking (FGCN 2007).

[10]  Hong Jiang,et al.  DBA: A Dynamic Bloom Filter Array for Scalable Membership Representation of Variable Large Data Sets , 2011, 2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems.

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

[12]  Peng Wang,et al.  Research on Optimization Strategy to Data Clustered Storage of Consistent Hashing Algorithm , 2016 .

[13]  Hailong Sun,et al.  R-Memcached: a consistent cache replication scheme with Memcached , 2014, Middleware.

[14]  Jiao Li,et al.  Study on a Network Communication Optimization Algorithm of P2P Mode , 2009, 2009 International Conference on Artificial Intelligence and Computational Intelligence.

[15]  Zhang Hai-tao,et al.  Storage and load balancing for large-scale comment data on heterogeneous Redis cluster , 2017 .