C. S. Jensen, D. Lin and B. C. Ooi, “Query and Update Efficient B+-Tree Based Indexing of Moving Objects,” Proceedings of the 30th International Conference on Very Large Data Bases, Toronto, 29 August - 3 September 2004, pp. 768-779.

has been cited by the following article:

• TITLE: A Dynamic Interval Based Circular Safe Region Algorithm for Continuous Queries on Moving Objects

  AUTHORS: Shengsheng Wang, Chen Zhang

  KEYWORDS: Location Based Service, Moving Object Database, Continuous Spatial Query

  JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.4 No.5, May 12, 2011

  ABSTRACT: Moving object database (MOD) engine is the foundation of Location-Based Service (LBS) information systems. Continuous queries are important in spatial-temporal reasoning of a MOD. The communication costs were the bottleneck for improving query efficiency until the rectangular safe region algorithm partly solved this problem. However, this algorithm can be further improved, as we demonstrate with the dynamic interval based continuous queries algorithm on moving objects. Two components, circular safe region and dynamic intervals were adopted by our algorithm. Theoretical proof and experimental results show that our algorithm substantially outperforms the traditional periodic monitoring and the rectangular safe region algorithm in terms of monitoring accuracy, reducing communication costs and server CPU time. Moreover, in our algorithm, the mobile terminals do not need to have any computational ability.