%0 Journal Article
%T Optimized Propagation Algorithms for Multi-Replication Definition<br>关于多重复制定义的优化传播算法
%A ZHE Jing
%A SUN Yu-Fang
%A <br>者敬
%A 孙玉芳
%J 软件学报
%D 2003
%I 
%X Multi-replication definition (MRD) is a new trend of database replication, but it will increase the propagation costs. In this paper, three optimized propagation algorithms for MRD are presented, D-M, ILS and LIS. D-M Algorithm gets the minimum individual propagation cost by dividing replication objects and merging propagation objects. Based on it, ILS makes the total costs to the least in strict Chain Topology scenarios, and LIS gets optimized total costs in other common situations by decomposing the propagation task. Their correctness and efficiencies are validated both theoretical and experimentally.
%K database replication
%K algorithm
%K propagation
%K multi-replication definition<br>数据库复制
%K 算法
%K 传播
%K 多重复制定义
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=948E9F9C02E440C4&yid=D43C4A19B2EE3C0A&vid=F3583C8E78166B9E&iid=0B39A22176CE99FB&sid=D6354F61445E9456&eid=FBCA02DBD05BD4EA&journal_id=1000-9825&journal_name=软件学报&referenced_num=3&reference_num=5