Abstract: One of the most important algorithms in spatial database is reverse 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.This paper proposes 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 k nearest neighbor query for moving objects is presented.