Materialization-based query processing algorithms on road networks

In practice, objects, likes cars and people with mobile phones, can usually move on road networks. In this paper, we propose new materialization-based query processing algorithms for typical spatial queries in spatial network databases (SNDB), such as range search and k nearest neighbors (k-NN) search. Our query processing algorithms can reduce the computation time of network distance between a pair of nodes and the number of disk I/Os required for accessing nodes by using the shortest network distances of all the nodes on spatial networks. Thus, our query processing algorithms improve the existing efficient k-NN (INE) and range search (RNE) algorithms proposed by Papadias et al. [1]. It is shown that our range query processing algorithm achieves about up to one of magnitude better performance than the RNE and our k-NN query processing algorithm achieves about up to 150% performance improvements over INE.