Efficient Reverse kNN Query Algorithm on Road Network Distances Using Partitioned Subgraphs
Reverse k-nearest neighbor (RkNN) queries in road network distances require long processing time in most conventional algorithms because these require kNN search on every visited node. In this paper, we propose a fast RkNN search algorithm that runs using a simple materialized path view (SMPV). In addition, we adopt the incremental Euclidean restriction (IER) strategy for fast kNN queries. In the SMPV used in our proposed algorithm, distance tables are constructed only inside of an individual partitioned subgraph, therefore the amount of data is drastically reduced in comparison with the conventional materialized path view (MPV). According to our experimental results using real road network data, our proposed method showed 100 times faster in processing time than conventional approaches when POIs are sparsely distributed on the road network.
Unable to display preview. Download preview PDF.
- 3.Hlaing, A.T., Htoo, H., Ohsawa, Y., Sonehara, N., Sakauchi, M.: Shortest path finder with light materialized path view for location based services. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds.) WAIM 2013. LNCS, vol. 7923, pp. 229–234. Springer, Heidelberg (2013)CrossRefGoogle Scholar