吉林大学学报（理学版）Issue(3)：525-530,6.DOI:10.13413/j.cnki.jdxblxb.2015.03.33
并行环境下基于图着色理论的空间数据部署
Graph Coloring Based Spatial Data Placement towards Parallel Computing System
摘要
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分类
信息技术与安全科学引用本文复制引用
殷君茹,唐小明,李惺颖,卜祥亮..并行环境下基于图着色理论的空间数据部署[J].吉林大学学报（理学版）,2015,(3):525-530,6.基金项目
国家高技术研究发展计划863项目基金(批准号:2012AA102001)和国家林业公益性行业科研专项基金(批准号:201304215) （批准号:2012AA102001）
