期刊名称：Journal of Software Engineering and Applications
印刷版ISSN：1945-3116
电子版ISSN：1945-3124
出版年度：2019
卷号：12
期号：4
页码：72-84
DOI：10.4236/jsea.2019.124006
出版社：Scientific Research Publishing
摘要：We propose an influential set based moving k keyword query processing model, which avoids the shortcoming of safe region-based approaches that the update cost and update frequency cannot be optimized simultaneously. Based on the model, we design a parallel query processing method and a parallel validation method for multicore processing platforms. The time complexity of the algorithms is O((log D +p.k)/p.k) and O(log p.k), respectively, which are all O(1/k) times the time complexity of the state-of-the-art method. The experiment result confirms the superiority of our algorithms over the state-of-the-art method.
关键词：Spatial Keywords;KNearest Neighbors;Influential Set;Spatial Moving Query;Safe Region
