摘要
在深入分析了Hilbert空间排列码的线性映射特性后,将其应用于数据划分之中,并给出了具体的实现算法。本算法既考虑了空间目标的聚集性,又考虑了各个划分结点上数据存储量的平衡性,极大地提高了并行空间数据库的处理效率。
The excellent linear mapping characteristics of Hilbert spatial ordering code is studied and applied to spatial partitioning of data, and a concrete algorithm is given. In this algorithm, the clustering performance of spatial objects is taken into account, and the balance of data storage on each processing node is also taken into account, which greatly improves the processing efficiency of parallel spatial database.
出处
《武汉大学学报（信息科学版）》
EI
CSCD
北大核心
2007年第7期650-653,共4页
Geomatics and Information Science of Wuhan University
基金
国家863计划资助项目(2005AA113150)
湖北省自然科学基金资助项目(2004ABA013)
