Abstract
Data partitioning is the basis of massive data distributed storage management and consistent hashing algorithm is one of the most popular data partitioning methods. We analyzes consistent hashing algorithm and find it can not guarantee the dynamic load balancing of the nodes in the system during the running time. To solve this problem,we propose a consistent hashing based data redistribution algorithm(CHRA). And the comparison of our simulation experiments verifies that the CHRA can balance the load of nodes in the system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Karger, D., Lehman, E., Leighton, T., et al.: Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 654–663. ACM (1997)
Scheuermann, P., Weikum, G., Zabback, P.: Data partitioning and load balancing in parallel disk systems. VLDB J. 7(1), 48–66 (1998)
Ceri, S., Negri, M., Pelagatti, G.: Horizontal data partitioning in database design. In: Proceedings of the 1982 ACM SIGMOD International Conference on Management of Data, pp. 128–136. ACM (1982)
Byers, J., Considine, J., Mitzenmacher, M.: Simple load balancing for distributed hash. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)
Guo, M., Nakata, I.: A framework for efficient data redistribution on distributed memory multicomputers. J. Supercomput. 20(3), 243–265 (2001)
Herault, T., Herrmann, J., Marchal, L., et al.: Determining the optimal redistribution for a given data partition. In: 2014 IEEE 13th International Symposium on Parallel and Distributed Computing (ISPDC), pp. 95–102. IEEE (2014)
Yousefi’zadeh, H.: Database load balancing for multi-tier computer systems: U.S. Patent 6,950,848, 27 September 2005
Han, J., Haihong, E., Le, G., et al.: Survey on NoSQL database. In: 2011 6th International Conference on Pervasive Computing and Applications (ICPCA), pp. 363–366. IEEE (2011)
DeCandia, G., Hastorun, D., Jampani, M., et al.: Dynamo: amazon’s highly available key-value store. ACM SIGOPS Oper. Syst. Rev. 41(6), 205–220 (2007)
Feinberg, A.: Project voldemort: reliable distributed storage. In: Proceedings of the 10th IEEE International Conference on Data Engineering (2011)
Acknowledgment
This paper is supported by the national high technology research and developmentprogramme (863programme) (2012AA01A401), the national natural science foundation (60933005, 91124002) and the national information security program242 (2011A010).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Fu, X., Peng, C., Han, W. (2015). A Consistent Hashing Based Data Redistribution Algorithm. In: He, X., et al. Intelligence Science and Big Data Engineering. Big Data and Machine Learning Techniques. IScIDE 2015. Lecture Notes in Computer Science(), vol 9243. Springer, Cham. https://doi.org/10.1007/978-3-319-23862-3_55
Download citation
DOI: https://doi.org/10.1007/978-3-319-23862-3_55
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23861-6
Online ISBN: 978-3-319-23862-3
eBook Packages: Computer ScienceComputer Science (R0)