An Update Propagation Method Based on the Tree of Replicas in Partially Replicated Databases

摘要

In the single master lazy updates propagation methods that guarantee weakly consistency, they may increase the read availability, but have more chances for update conflicts. We propose an effective update propagation method to resolve this non-serializable execution. The proposed method is based on the balanced tree of replicas in the partially replicated databases and uses the timestamp and the information of the RCTL(the most Recent Committed update-Transaction List) in the status database. We made an experiment of our algorithm through the simulation, and proved that it has good performance due to reducing the abort ratio and response time of transactions.