东南大学学报（自然科学版）Issue(5)：840-844,5.DOI:10.3969/j.issn.1001-0505.2015.05.005
PMkSK：一种空间关键字移动近邻查询并行处理方法
PMkSK:a parallel processing method for moving top spatial keyword query
摘要
Abstract
In order to improve the processing efficiency of moving top-k spatial keyword queries,the concept of the keyword influential set is proposed,based on which a parallel processing method is designed.The method is composed of a parallel querying algorithm and a parallel verifying algo-rithm.First,the nearest neighbor set is calculated by using the parallel query algorithm.Then,the query region is obtained,and the nearest neighbor set is found in the region.Finally,the moving top-spatial keyword query is realized by verifying the influential set with the movement of the queri-er.The experimental results show that the time complexities of these two algorithms are O((log D+k)/k)and O(logk),respectively,which are O(1 /k)times over those of the corresponding state-of-the-art methods.Here, D is the number of the spatial objects.On multi-core systems,the processing times of the two proposed algorithms are one order of magnitude lower than those of the corresponding state-of-the-art methods.The influential-set-based parallel query processing method can avoid the shortcoming of the safe-region-based methods that the update cost and update frequen-cy cannot be optimized simultaneously,and can process moving top-k spatial keyword queries effi-ciently.关键词
空间/k 近邻/影响集/空间移动查询/安全区域Key words
spatial keyword/k-nearest-neighbor/influential set/moving spatial query/safe region分类
信息技术与安全科学引用本文复制引用
李传文,谷峪,张统,于戈..PMkSK：一种空间关键字移动近邻查询并行处理方法[J].东南大学学报（自然科学版）,2015,(5):840-844,5.基金项目
国家自然科学基金资助项目（61300021）、中央高校基本科研业务费专项基金资助项目（N140404008）． （）
