Research On Technology Of Reverse Nearest Neighbor Query For Moving Objects In Spatial Database

In recent years, the developments in the field of global positioning systems,geographic information systems, satellite image data processing, computer-aided design, and mobile computing,spatial data query have aroused great attention, however, with the mobile objects increases, increasing the amount of spatial data, the spatial data structure is also more complex, the query algorithm with large number of mobile objects in the spatial database is becoming increasingly important.Reverse Nrearest Neighborhood (RNN) query is one of the most important database query algorithm in the field. Tranditional RNN query techonology are most likely using static spatial information which is little dots in the static-state space. But as the internet goes mobile, the query requsts form mobile devices goes too far where the tranditional RNN query technolgy can’t meet todays query needs. For mobile data in the field of spatial database query difficult and hot issues in a comprehensive summary of the analysis of research at home and abroad on the basis of the optimal location query in the static spatial database environment and dynamic environment in the reverse nearest neighborhood (RNN) query solution programs. The main research content and innovations are as follows:(1) a static environment, anti-reverse nearest neighbor query algorithm. The specific research the grid index model mechanism, according to the grid space abatement strategy in a static environment reverse nearest neighbor query algorithm GRNN algorithm, the efficiency of the algorithm and the division of the grid cell size of the dataset of moving objects have a close relationship, it takes full advantage the grid space abatement strategies, the algorithm in the mobile data set great next to effectively reduce the search space of the query, thus ensuring the search efficiency of the algorithm has a higher than other algorithms.(2) The best location of query in grid space, according to the problem of finding the optimal position to build new service point under the condition of data point can’t move in real life, this thesis study the optimal position query technology of data concretely, make the best use of the Reverse nearest neighbor query algorithm in the static environment to find the point who has the largest number of the Reverse Nearest Neighborhood in a given area, and this point is the one whose position is the best.(3)The dynamically Reverse nearest neighbor query of moving objects, contra pose the problem of Reverse nearest neighbor query under the condition of moving object point and query point moving at the same time, the thesis study contact the reverse nearest neighbor query in dynamic environment, and come up with a moving object dynamic reverse nearest neighbor query processing framework MPCRNN, this kind of framework can divided query processing process into pre-processing stage and query processing stage,and come up with the MPCRNN query algorithm for the framework as the same time, also it is verified by the experiment that the algorithm has a good query performance and update performance.