电子学报2017，Vol.45Issue(2)：376-383,8.DOI:10.3969/j.issn.0372-2112.2017.02.016
一种基于密度网格索引的κ-最近邻查询算法
A κ-Nearest Neighbor Query Algorithm for Density Grid-Based Index
摘要
Abstract
The rapid development of location based services set higher demands on efficiency promotion and cost control of the services.In the paper,we propose a κ-nearest neighbor query algorithm based on density grid index.In processing of the algorithm,a series of candidate search radii is obtained by utilizing of the geometrical features of the rectangle.Then the appropriate candidate search radii are chosen to make distance filtering according to the density distribution of the moving object,it is useful to achieve reducing the unnecessary accessing to memory index units and disk index units.Our extensive experiments show that the efficiency of the density grid index with our algorithm is about equal to ST2B-tree on the κ-nearest neighbor query,but our algorithm has obvious advantages in the cost of I/O.关键词
κ-最近邻查询/移动对象/密度网格/候选搜索半径Key words
κ-nearest neighbor query/moving objects/density grid/candidate search radii分类
信息技术与安全科学引用本文复制引用
章登义,李想..一种基于密度网格索引的κ-最近邻查询算法[J].电子学报,2017,45(2):376-383,8.基金项目
国家自然科学基金(No.60903035,No.41001296) （No.60903035,No.41001296）
国家863高技术研究发展计划(No.2013AA12A301) （No.2013AA12A301）
