Author(s)

Kunlun Chen, Yanru Liu^*, Qingxu Deng

School of Information & Engineering, Northeastern University, Shenyang, China.

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, K Nearest Neighbors, Influential Set, Spatial Moving Query, Safe Region

Chen, K. , Liu, Y. and Deng, Q. (2019) A Parallel Processing Method for Moving Top-K Spatial Keyword Query. Journal of Software Engineering and Applications, 12, 72-84. doi: 10.4236/jsea.2019.124006.