| 摘要: |
| 多重复制定义(MRD)虽然是数据库复制发展的一个新趋势,但是它会引起传播开销的增大.提出了关于MRD的3个优化传播算法:D-M,ILS和LIS算法.其中D-M算法通过拆分复制对象和合并传播对象获得最小的单次传播开销.在此基础上,ILS算法在链式结构下使总传播开销最小.而LIS算法在更普遍条件下通过分解传播任务得到优化的总传播开销.理论和实验分别验证了它们的正确性和有效性. |
| 关键词: 数据库复制 算法 传播 多重复制定义 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Natural Science Foundation of China under Grant No.19831020 (国家自然科学基金) |
|
| Optimized Propagation Algorithms for Multi-Replication Definition |
|
ZHE Jing,SUN Yu-Fang
|
| Abstract: |
| 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. |
| Key words: database replication algorithm propagation multi-replication definition |
