Dynamic Reverse Furthest Neighbor Querying Algorithm of Moving Objects

摘要

With the development of wireless communications and positioning technologies, locations of moving objects are highly demanding services. The assumption of static data is majorly applied on previous researches on reverse furthest neighbor queries. However, the data are dynamic property in the real world. Even, the data-aware are uncertain due to the limitation of measuring equipment or the delay of data communication. To effectively find the influence of querying a large number of moving objects existing in boundary area vs querying results of global query area, we put forward dynamic reverse furthest neighbor query algorithms and probabilistic reverse furthest neighbor query algorithms. These algorithms can solve the query of weak influence set for moving objects. Furthermore, we investigate the uncertain moving objects model and define a probabilistic reverse furthest neighbor query, and then present a half-plane pruning for individual moving objects and spatial pruning method for uncertain moving objects. The experimental results show that the algorithm is effective, efficient and scalable in different distribution and volume of data sets.