摘要
在并行空间数据库中,空间数据集在各计算节点是否聚集划分,对提高空间并行查询效率起着关键的作用。Oracle Spatial采用的基于格网的划分方法只考虑了数据集在各节点是否均衡划分,而未考虑空间数据的拓扑特征。基于空间数据聚集划分的目的,提出了一种基于K-平均聚类算法的空间数据划分方法。实验证明,该方法极大地提高了空间数据并行检索和查询效率。
In parallel spatial database,it is necessary to make the spatial data set cluster in each node,because it can improve the efficiency of parallel database query. The partition approach of Oracle Spatial is based on grid. It only eonsideres data sets in each node are a balanced division,without taking into account the topological characteristics of these data. In order to improve the problem, this paper presented a new spatial data partition approach which is based on Kmeans clustering algorithm. Experiments show that the method greatly improves the spatial data retrieval and query efficiency in parallel.
出处
《计算机科学》
CSCD
北大核心
2010年第8期198-200,共3页
Computer Science
基金
国家自然科学基金(40761018)资助
