New Range and k-NN Query Processing Algorithms Using Materialization Technique on Spatial Network

Abstract

In this paper, we propose new query processing algorithms for typical spatial queries in SNDB, such as range search and k nearest neighbors (k-NN) search. Our two 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 a materialization-based technique with the shortest network distances of all the nodes in the spatial network. Thus, our query processing algorithms improve the existing efficient k-NN (INE) and range search (RNE) algorithms proposed by [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.