Abstract：With the development of wireless communications and positioning technologies,location based service for moving objects require more supporting technologies.In order to effectively find the influence of querying large number of moving objects existing in boundary area vs querying results of global query area,we put forward a dynamic reverse furthest neighbor query algorithm.The algorithm can solve weak influence set of moving objects.The dynamic reverse furthest neighbor query aims to find the objects having a given query object as their furthest neighbors.According to a dynamic and updated case for the moving object,a query method of indexing structure based on TPR-tree is given,which uses half plane pruning strategy and improved FTPL pruning method is also given.Through the filter and refinement steps,we implement dynamic reverse furthest neighbor query for moving objects.Experimental results show that the algorithm is correct,and query performance is ideal.
2016, Vol. 37 
