本研究之目的在於解決完全重複性分散式資料庫（Fully Redundant Distributed Database) 同步更新的問题，本論文主要依據限制檢查演算法的架構，加以局部修改，提出新修正的無主控端 演算法，以改善原演算法的執行效率。在方法上以實作的方式，來証明並比較其執行效率，以贵際 的驗證數據提供學者參考。

The goal of this project is to resolve the synchronizing updates in a fully redundant distributed database by using a New Constraint Checking Algorithm. The new algorithm is an improved version of the original algorithm to obtain more efficient performance, where both the cases including and without the master site ara considered. Through a practical implementation and a detailed performance evaluation, we hope to provide some useful information in this field.