Recent years spatial database become a new research field, and it is a multidisciplinary research. Spatial database is popular in geographic information system, computer aided design system, multimedia information system, data ware house and other areas.One of the most important algorithms in spatial database is reverse nearest neighbor query which is a new query method proposed based on nearest neighbor query. Conventional query method focus on searching static objects mainly. With the rapid advancement in wireless communications and positioning techniques, algorithms for efficiently answering queries about large populations of moving objects are gaining interest. Conventional query method of reverse nearest neighbor is not answering moving objects queries.On the basis of analyzing some reverse nearest neighbor query methods, this paper proposed a dynamic reverse nearest neighbor query algorithm for moving objects. TPR-tree is used to indexing continuously moving objects. A trimming strategy which improved half-space trimming strategy is proposed according to the diagonal of rectangle. Furthermore, the dynamic reverse nearest neighbor query for moving objects is presented. The correctly, effectively and complexity of the dynamic reverse nearest neighbor query algorithm is proved. At the same time the technology of dynamic reverse nearest neighbor query for moving objects is extended to dynamic reverse k nearest neighbor query. The algorithm for dynamic reverse k nearest neighbor query for moving objects is also presented. And the correctly, effectively and complexity of the dynamic reverse k nearest neighbor algorithm is also proved. The method of this paper proposed can answer the search of dynamic objects effectively. This research is important to development of spatial database query technology. |