An Optimistic Data Consistency Maintenance Method Based on Data Dependence

Abstract

This paper proposes an optimistic data consistency method according to the question about data dependence in data consistency.In the method,data object is partitioned into data blocks by fixed size as the basic unit of data management.Updates are compressed by Bloom filter technique and propagated in double-path.Negotiation algorithms detect and reconcile update conflicts,and dynamic data management algorithms accommodate dynamic data processing.The results of the performance evaluation show that it is an efficient method to achieve consistency,good dynamic property,and strong robustness when choosing the size of data block appropriately.At the same time,a feasible way is put forward on how to choose appropriate data block size.