Reverse Nearest Neighbors Query of Moving Objects Based on HRNNTree

Abstract

\n\nReverse nearest neighbors query is an important means to solve many practical\napplications based on the concept of Influence Sets. It is widely used in various fields such as\ndata mining, decision support, resources allocation, knowledge discovery, data flow, bioinformatics\nand so on.\n\n\n\nThis work aims to improve time efficiency of Reverse Nearest Neighbors query of moving\nobjects with large data scale.\n\n\n\nA new spatio - temporal index HRNN-tree is developed.Then an algorithm for reverse\nnearest neighbors query based on HRNN-tree is developed.\n\n\n\nOur algorithm is superior to the existing method in execution time. The performance of our\nalgorithm is excellent especially for the queries with large data scale and small values of k.\n\n\n\nThis study devises a new spatio - temporal index HRNN-tree. Then an algorithm for reverse\nnearest neighbor search of moving objects is developed based on this index. This algorithm avoids that the\nquery performance deteriorates rapidly as the data space grows and has a better performance fort the large\ndata space. This work will be helpful to enrich and improve the abilities of intelligent analysis, mobile\ncomputing and quantitative query based on distance for spatio - temporal database.\n