中文摘要：

随着无线通信和定位技术的不断发展,对移动对象的位置服务提出更高的要求.为了有效地发现大量的边界区域移动对象对广泛分布的全局查询对象所产生的影响,提出了一种动态的反向最远邻查询算法,以解决移动对象的弱影响集相关问题.针对移动对象是动态环境情况下提出动态反向最远邻查询算法,并以TPR-tree为索引结构,采用半平面修剪策略,给出了改进的FTPL修剪方法.通过过滤-精炼两步骤对查询空间进行安全高效的修剪,提出移动对象的动态反向最远邻查询算法.实验结果验证了本文算法的正确性和查询性能优势.

英文摘要：

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 algo- rithm 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 inde- xing 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 re- suits show that the algorithm is correct,and query performance is ideal.