Browse > Article
http://dx.doi.org/10.9708/jksci.2021.26.04.063

A Batch Processing Algorithm for Moving k-Nearest Neighbor Queries in Dynamic Spatial Networks  

Cho, Hyung-Ju (Dept. of Software, Kyungpook National University)
Publication Information
Journal of the Korea Society of Computer and Information / v.26, no.4, 2021 , pp. 63-74 More about this Journal
Abstract
Location-based services (LBSs) are expected to process a large number of spatial queries, such as shortest path and k-nearest neighbor queries that arrive simultaneously at peak periods. Deploying more LBS servers to process these simultaneous spatial queries is a potential solution. However, this significantly increases service operating costs. Recently, batch processing solutions have been proposed to process a set of queries using shareable computation. In this study, we investigate the problem of batch processing moving k-nearest neighbor (MkNN) queries in dynamic spatial networks, where the travel time of each road segment changes frequently based on the traffic conditions. LBS servers based on one-query-at-a-time processing often fail to process simultaneous MkNN queries because of the significant number of redundant computations. We aim to improve the efficiency algorithmically by processing MkNN queries in batches and reusing sharable computations. Extensive evaluation using real-world roadmaps shows the superiority of our solution compared with state-of-the-art methods.
Keywords
Spatial databases; Moving k-nearest neighbor query; Batch processing; Dynamic spatial network;
Citations & Related Records
연도 인용수 순위
  • Reference
1 T. Kim, H.-J. Cho, H. J. Hong, H. Nam, H. Cho, G. Y. Do, and P. Jeon, "Efficient processing of k-farthest neighbor queries for road networks," Journal of The Korea Society of Computer and Information, vol. 24, no. 10, pp. 79-89, 2019.
2 F. M. Choudhury, J. S. Culpepper, Z. Bao, and T. Sellis, "Batch processing of top-k spatial-textual queries," ACM Transactions on Spatial Algorithms and Systems, vol. 3, no. 4, pp. article ID 13, 2018.
3 K. C. K. Lee, W.-C. Lee, B. Zheng, and Y. Tian, "ROAD: a new spatial object search framework for road networks," IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 3, pp. 547-560, 2012.   DOI
4 D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, "Query processing in spatial network databases," In Proc. of International Conference on Very Large Data Bases, pp. 802-813, 2003.
5 B. Shen, Y. Zhao, G. Li, W. Zheng, Y. Qin, B. Yuan, and Y. Rao, "V-tree: efficient knn search on moving objects with road-network constraints," In Proc. of International Conference on Data Engineering, pp. 609-620, 2017.
6 U. Demiryurek, F. B. Kashani, and C. Shahabi, "Efficient continuous nearest neighbor query in spatial networks using Euclidean restriction," In Proc. of International Symposium on Advances in Spatial and Temporal Databases, pp. 25-43, 2009.
7 K. Mouratidis, M. L. Yiu, D. Papadias, and N. Mamoulis, "Continuous nearest neighbor monitoring in road networks," In Proc. of International Conference on Very Large Data Bases, pp. 43-54, 2006.
8 9th DIMACS Implementation Challenge: Shortest Paths. Available online: http://www.dis.uniroma1.it/challenge9/download.shtml (accessed on 17 Feb. 2021).
9 Real Datasets for Spatial Databases. Available online: https://www.cs.utah.edu/-lifeifei/SpatialDataset.htm (accessed on 17 Feb. 2021).
10 R. Zhong, G. Li, K.-L. Tan, L. Zhou, and Z. Gong, "G-tree: an efficient and scalable index for spatial search on road networks," IEEE Transactions on Knowledge and Data Engineering, vol. 27, no. 8, pp. 2175-2189, 2015.   DOI
11 B. Cao, C. Hou, S. Li, J. Fan, J. Yin, B. Zheng, and J. Bao, "SIMkNN: a scalable method for in-memory knn search over moving objects in road networks," IEEE Transactions on Knowledge and Data Engineering, vol. 30, no. 10, pp. 1957-1970, 2018.   DOI
12 Y. Xu, J. Qi, R. Borovica-Gajic, and L. Kulik, "Finding all nearest neighbors with a single graph traversal," In Proc. of International Conference on Database Systems for Advanced Applications, pp. 221-238, 2018.
13 H. Samet, J. Sankaranarayanan, and H. Alborzi, "Scalable network distance browsing in spatial databases," In Proc. of International Conference on Mobile Data Management, pp. 43-54, 2008.
14 T. Abeywickrama and M. A. Cheema, "Efficient landmark-based candidate generation for knn queries on road networks," In Proc. of International Conference on Database Systems for Advanced Applications, pp. 425-440, 2017.
15 T. Dong, Y. Lulu, Y. Shang, Y. Ye, and L. Zhang, "Direction-aware continuous moving k-nearest-neighbor query in road networks," ISPRS International Journal of Geo-Information, vol. 8, no. 9, article ID 379, 2019.
16 S. Luo, B. Kao, G. Li, J. Hu, R. Cheng, and Y. Zheng, "TOAIN: a throughput optimizing adaptive index for answering dynamic knn queries on road networks," PVLDB, vol. 11, no. 5, pp. 594-606, 2018.
17 Y. Yang, H. Li, J. Wang, Q. Hu, X. Wang, and M. Leng, "A novel index method for k nearest object query over time-dependent road networks," Complexity, vol. 2019, article ID 4829164, 2019.
18 B. Zheng, K. Zheng, X. Xiao, H. Su, H. Yin, X. Zhou, and G. Li, "Keyword-aware continuous knn query on road networks," In Proc. of International Conference on Data Engineering, pp. 871-882, 2016.