%0 Journal Article
%T A Parallel Processing Method for Moving Top-K Spatial Keyword Query
%A Kunlun Chen
%A Yanru Liu
%A Qingxu Deng
%J Journal of Software Engineering and Applications
%P 72-84
%@ 1945-3124
%D 2019
%I Scientific Research Publishing
%R 10.4236/jsea.2019.124006
%X 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 <span style=\"white-space:normal;\"><em>O</em></span>((log|<em>D</em>|+<em>p</em>.<em>k</em>)/<em>p</em>.<em>k</em>)&nbsp;and <span style=\"white-space:normal;\"><em>O</em></span>(log <em>p</em>.<em>k</em>), respectively, which are all <em>O</em>(1/<em>k</em>) 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.
%K Spatial Keywords
%K &lt
%K i&gt
%K K&lt
%K /i&gt
%K Nearest Neighbors
%K Influential Set
%K Spatial Moving Query
%K Safe Region
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=92017