Abstract:

An algorithm suitable for spatial vector data placement based on graph coloring theory was presented in the parallel system of computing distributed to data nodes. The deployment problem was transferred into graph vertex coloring problem, and the information query efficiency of any spatial area was thus improved. Moreover, the algorithm based on graph vertex coloring problem was proposed and improved by the task of nodes. This algorithm can achieve discrete deployment of massive spatial data granularity and storage load balance of the nodes, improve the degree of parallelism spatial data retrieval and query, and make full use of parallel computing resources.

Key words: spatial data placement, data granularity, parallel computing system, graph coloring theory, load balancing