Data replication introduces well-known consistency issues. This paper puts forward the question about data dependence in data consistency, which embodies pseudo-conflict updates and update dependency. According to that, an optimistic data consistency method is proposed. In our 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 our method is an efficient method to achieve consistency, good dynamic property, and strong robustness.