Optimizing Distributed Database by the Means of Heuristic Data Allocation of Static Schedules

Hao Luo · Journal of Guizhou University of Technology · 2004

This paper briefly introduces the sort of data allocation method in the distributed database and analyzes an example completely with the heuristic method of static schedules.It validates this method can solve the problem of optimizing data allocation.The result indicates that this arithmetic may confirm the location of piece and minimize the transmission fare of network.

Read the paper · More papers on PaperTik