A Spatial Range Query Algorithm Based on Grid Partition

摘要：

Spatial range query algorithms based on brute-force method,R-tree,VA-the and NB-tree achieve better performance in low-dimensional space,but highdimensional space leads to performance deterioration. The reduction of dimensionality is the key to spatial range query in hight-dimensionat space.Z curve has been used as a mapping method from high-dimensional space into linear space. Z curve can partition data space into grids,and impose a linear order of points in grids. Based on the clustering characteristic of Z curve,the paper presents a method of grid partition,a procedure of partitioning search region,and a highdimensional spatial range query algorithm. Experimental results are offered to demonstrate the performance of the algorithm.

关键词： spatial range query reduction of dimensionality Z curve grid partition search region

作者: Hongbo Xu Wen Hu Haiwei Pan Xiang Gao Weiwei Xu

作者单位: Harbin University of Commerce,China Harbin Engineering University,China Harbin Normal University,China

会议类型: 国际会议

会议名称: 2011 International Conference on Opto-Electronics Engineering and Information Science(2011光电电子工程与信息科学国际会议 ICOEIS 2011)

会议地点: 西安

会议语种:英文

页码: 987-991

在线出版日期: 2011-12-23（万方平台首次上网日期，不代表论文的发表时间）