【摘要】 本文提出了以最小代价为目标的分布式数据库数据分布模型求解的启发式算法,利用数据分布的启发信息,将互相有紧密联系的n个关系的数据分布问题分解为具有较松散联系的n个关系的分布问题,并进行迭代调整,使算法的时间复杂度大为降低,算法精度也接近优化程度。更多还原

【Abstract】 In this paper, a heuristic algorithm for solving the data allocationmodel in distributed databases with the aim of minimum cost is presented. Using heuristic information, n close relations are decomposed into n loose ones in;data allocation problems, and iteration adjustment is used, so that the time complexity of the algorithm is greatly reduced, the algorithm is near the optimal solution.更多还原