Continuous Range Search Query Processing in Mobile Navigation

Range search query processing has become one of the most important technologies in spatial and mobile databases. Most literature focuses on static range search extended from one point on both Euclidean distance and actual network distance, but there are only a few methods which can properly solve the problem for moving users, such as searching objects of interest on a road within a certain range. Although there are some techniques, which address continuous search, most approaches are absorbed in the KNN (k nearest neighbour) queries which are a different research area. In this paper, we propose two new methods to process continuous range search query in mobile computing. One is constructed using R-tree index based on Euclidean distance, and the other addresses the requirement on actual network distance.