Username   Password       Forgot your password?  Forgot your username? 


Efficiently Retrieving Differences Between Remote Sets using Counting Bloom Filter

Volume 15, Number 7, July 2019, pp. 1947-1954
DOI: 10.23940/ijpe.19.07.p22.19471954

Xiaomei Tiana,b,*, Huihuang Zhaoa,b, Yaqi Suna,b, and Xiaoman Lianga,b

aCollege of Computer Science and Technology, Hengyang Normal University, Hengyang, 421002, China
bHunan Provincial Key Laboratory of Intelligent Information Processing and Application, Hengyang, 421002, China


(Submitted on April 13, 2019; Revised on May 25, 2019; Accepted on June 25, 2019)


Retrieving differences between remote sets is widely used in set reconciliation and data deduplication. Set reconciliation and data deduplication between two nodes are widely used in various network applications. The basic idea of the difference retrieving problem is that each member of a node pair has an object set and seeks to find all differences between the two remote sets. There are many methods for retrieving difference sets, such as the standard Bloom filter (SBF), counting Bloom filter (CBF), and invertible Bloom filter (IBF). In these methods, based on the standard Bloom filter or its variants, each node represents its objects using a standard Bloom filter or other Bloom filter, which is then exchanged. A receiving node retrieves different objects between the two sets according to the received SBF, CBF, or IBF. We propose a new algorithm for retrieving differences that finds differences between remote sets using counting Bloom filters' deletion operation. The theoretical analyses and experimental results show that the differences can be retrieved efficiently. Only a very small number of differences are missing in the retrieving process, and this false negative rate can be decreased to 0% by adjusting the counting Bloom filter's parameters.


References: 16

  1. D. Guo, Y. H. Liu, X. Y. Li, and P. L. Yang, “False Negative Problem of Counting Bloom Filter,” IEEE Transactions on Knowledge & Data Engineering, Vol. 22, No. 5, pp. 651-664, 2010
  2. D. R. Mittal and M. Sharma, “A Comparative Study of Different Load Balancing Algorithms in Cloud Computing,” Mody University International Journal of Computing and Engineering Research, Vol. 1, No. 1, pp. 51-55, 2017
  3. A. Tripathi and S. Singh, “A Literature Review on Algorithms for the Load Balancing in Cloud Computing Environments and Their Future Trends,” Mathematical and Computer Modelling, Vol. 21, No. 1, pp. 64-73, 2017
  4. C. Reiss, A. Tumanov, G. R. Ganger, and R. H. Katz, “A Towards Understanding Heterogeneous Clouds at Scale: Google Trace Analysis,” in Proceedings of the 3rd ACM Symp on Cloud Computing, 2012
  5. S. Deng, C. G. Yuan, L. C. Yang, and L. P. Zhang, “Distributed Electricity Load Forecasting Model Mining based on Hybrid Gene Expression Programming and Cloud Computing,” Pattern Recognition Letters, No. 109, pp. 72-80, 2018
  6. W. Zhong, Y. Zhuang, J. Sun, and J. J. Gu, “A Load Prediction Model for Cloud Computing using PSO-based Weighted Wavelet Support Vector Machine,” Applied Intelligence, pp. 1-12, 2018
  7. S. B. Shaw, C. Kumar, and A. K. Singh, “Use of Time-Series based Forecasting Technique for Balancing Load and Reducing Consumption of Energy in a Cloud Data Center,” in Proceedings of 2017 International Conference on Intelligent Computing and Control, pp. 1-6, 2017
  8. H. Y. Xu and B. Yang, “Energy-Aware Resource Management in Cloud Computing Considering Load Balance,” Journal of Information Science & Engineering, Vol. 33, No. 1, pp. 1-16, 2017
  9. R. Kaur and N. S. Ghumman, “A Load Balancing Algorithm based on Processing Capacities of VMs in Cloud Computing,” Big Data Analytics, pp. 63-69, Springer, Singapore, 2018
  10. D. Y. Xu and S. Ding, “Research on Improved GWO-Optimized SVM-based Short-Term Load Prediction for Cloud Computing,” Computer Engineering and Applications, Vol. 53, No. 7, pp. 68-73, 2017
  11. J. Q. Xie, Y. J. Liu, and S. Li, “Application of Improved Whale Algorithm in Load Forecasting of Cloud Computing Resources,” Computer Engineering and Applications, Vol. 54, No. 13, pp. 73-77, 2018
  12. Q. B. Nie, “Optimization Management of Task Scheduling for Cloud Resource Load Balance,” Computer Engineering and Design, Vol. 38, No. 1, pp. 18-21, 2017
  13. D. G. Li, L. Wu, and L. Li, “Research of Load Forecasting and Elastic Resources Scheduling of Openstack Platform based on Time Series,” Journal of Chongqing University of Posts and Telecommunications, Vol. 28, No. 4, pp. 560-566, 2016
  14. D. Wang and Z. Sun, “Big Data Analysis and Parallel Load Forecasting of Electric Power User Side,” Proceedings of the CSEE, Vol. 35, No. 3, pp. 527-537, 2015
  15. S. Rahnamayan, H. R. Tizhoosh, and M. M. Salama, “Opposition-based Differential Evolution,” IEEE Transactions on Evolutionary Computation, Vol. 12, No. 1, pp. 64-79, 2008
  16. Q. J. Liu, G. M. Chen, and X. F. Liu, “Genetic Algorithm based SVM Parameter Composition Optimizaiton,” Computer Applications and Software, Vol. 29, No. 4, pp. 94-96, 2012


Please note : You will need Adobe Acrobat viewer to view the full articles.Get Free Adobe Reader

This site uses encryption for transmitting your passwords.