J4 ›› 2007, Vol. 29 ›› Issue (6): 55-56.
• 论文 • 上一篇 下一篇
周婧[1] 王意洁[1] 李思昆[1] 王元志[2]
出版日期:
发布日期:
Online:
Published:
摘要：
针对数据一致性维护过程中存在的更新相关问题,本文提出一种更新冲突协商算法,利用Bloom Filter压缩技术表示更新,通过结点间的分工协作发现和解决更新相关冲突,并实现副本最终一致。模拟测试结果表明,该方法在一致性维护开销方面具有较好的性能。
关键词: P2P分布存储式系统 数据复制 数据一致性 更新相关性
Abstract:
According to the problem of update dependence in the course of data consistency maintenance, an update conflict negotiation algorithm is proposed. Updates are compressed by the Bloom Filter compression technique, and the conflicts of update dependence are detected and reconciled by the cooperation between nodes, and the consistency in replicas is achieved. The results of simulation show that it is an efficient algorithm to achieve good consistency overhead.
Key words: P2P distributed storage system, data replication, data consistency, update dependence
周婧[1] 王意洁[1] 李思昆[1] 王元志[2]. 一种解决更新相关的更新冲突协商算法[J]. J4, 2007, 29(6): 55-56.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://joces.nudt.edu.cn/CN/
http://joces.nudt.edu.cn/CN/Y2007/V29/I6/55
