Non-redundant Distributed Database Allocation Technology Research

Abstract

Redundancy is a traditional technique for improving the reliability of distributed systems. In many scenes, system redundancy is not available or not feasible. How to assign the tasks of parallel applications to the distributed system's processors and maximize the reliability of the system becomes one of the important issues that need to be studied. This paper proposes a dynamic non-redundant data allocation method for distributed database system, which specifies the fragment update parameters and dynamic cost parameters, to find the best solution for reallocating redundant data. Specifically, we use the parameters to iterative estimate the reassignment of the fragment to the cost of the node, according to the choice of the lowest cost of the node for data migration. The result shows that this kind of scheme can make full use of the advantages of non-redundant data allocation and fasten the speech of communication, which can further improve the consistency and reliability of the distributed database system.