Abstract: The range query on moving objects in road network is one of the classical query methods in spatial query processing,which has been widely used in many fields.However,there are still some shortcomings in the existing moving object range query methods in road networks.On the one hand,most of them only consider the network distance,but pay less attention to the movement direction of moving objects in road networks.On the other hand,a few query me-thods considering the movement direction are based on Euclidean space and can’t not be applied to large-scale road network to determine whether moving objects move toward query point.Aiming at the problem of accurately and efficiently finding moving objects toward the query point in large and complex road network,this paper proposed a direction-aware moving object range query algorithm in road network.In this method,R-tree and simple grid are taking as underlying index support,and an efficient determination method of moving object toward query point in road network is exploited,so as to efficiently query the moving object toward query point.At last,this paper designed experiments in terms of the query range,the number of moving object and the number of grid partition to evaluate the performance of the proposed algorithm.The experimental results show that the algorithm can achieve good query performance even in the case of large-scale complex road network under the condition that the index configuration is reasonable.

Key words: Direction-aware, Moving object, Range query, Road network