作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (19): 59-61. doi: 10.3969/j.issn.1000-3428.2009.19.019

• 软件技术与数据库 • 上一篇    下一篇

基于贝努利大数定律的数据分布算法

郑 胜,郝毫毫   

  1. (武汉工程大学电气信息学院,武汉 430073)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-10-05 发布日期:2009-10-05

Data Placement Algorithm Based on Bernoulli Laws of Large Number

ZHENG Sheng, HAO Hao-hao   

  1. (School of Electrical and Information Engineering, Wuhan Institute of Technology, Wuhan 430073)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-10-05 Published:2009-10-05

摘要: 数据量的快速增长,使得研究能够自动适应存储节点动态变化的数据分布方法成为分布式文件系统领域的难点和热点。基于贝努利大数定律提出一种自适应存储节点规模动态变化的数据分布算法,通过理论分析和实验证明,该算法能够实现在节点规模动态变化过程中数据分布的均衡性,并能保证迁移的数据量从统计意义上最优。

关键词: 分布式存储, 数据分布, 自适应

Abstract: Efficient and scalable data management becomes increasingly important in large-scale distributed storage systems. A key enabling technique is a flexible, balancing and scalable data object placement and location scheme that automatically adapts to the dynamic change of storage nodes. An algorithm for data placement is proposed, which is based on laws of large number. The basic algorithm promises probabilistically even data distribution and minimizing data movement when the number of storage nodes dynamically changes.

Key words: distributed storage, data placement, self-adaptive

中图分类号: