Beckmann, N., Kriegel, H., Schneider, R. and Seeger, B. (1990) The R^*-Tree: An Efficient and Robust Access Method for Points and Rectangles. ACM SIGMOD Record, 19, 322-331.
https://doi.org/10.1145/93605.98741

has been cited by the following article:

• TITLE: A Parallel Processing Method for Moving Top-K Spatial Keyword Query

  AUTHORS: Kunlun Chen, Yanru Liu, Qingxu Deng

  KEYWORDS: Spatial Keywords, K Nearest Neighbors, Influential Set, Spatial Moving Query, Safe Region

  JOURNAL NAME: Journal of Software Engineering and Applications, Vol.12 No.4, April 25, 2019

  ABSTRACT: 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.