Browse > Article
http://dx.doi.org/10.6109/jkiice.2014.18.12.2919

Efficient Nearest Neighbor Search on Moving Object Trajectories  

Kim, Gyu-Jae (Department of Computer Engineering, Pukyong University)
Park, Young-Hee (Department of Computer Engineering, Pukyong University)
Cho, Woo-Hyun (Department of Computer Engineering, Pukyong University)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.18, no.12, 2014 , pp. 2919-2925 More about this Journal
Abstract
Because of the rapid growth of mobile communication and wireless communication, Location-based services are handled in many applications. So, the management and analysis of spatio-temporal data are a hot issue in database research. Index structure and query processing of such contents are very important for these applications. This paper addressees algorithms that make index structure by using Douglas-Peucker Algorithm and process nearest neighbor search query efficiently on moving objects trajectories. We compare and analyze our algorithms by experiments. Our algorithms make small size of index structure and process the query more efficiently.
Keywords
Moving Object Trajectory; Index structure; Nearest Neighbor Search;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 Dongseop Kwon. "A Voronoi Diagram-Based Grid Structure for Efficient Nearest Neighbor Query Processing," in Journal of KSCI, vol. 13, No. 1, pp. 11-29, Jan. 2008.   과학기술학회마을
2 Nick Roussopoulos, Stephen Kelley, and Frederic Vincent, "Nearest Neighbor Queries," in Proc. ACM SIGMOD Conf, pp. 71-79, 1995.
3 R. Benetis, C. Jensen, G. Karciauskas, and S. Saltenis. "Nearest neighbor and reverse nearest neighbor queries for moving objeccts," in Proceedings of IDEAS, 2002.
4 Dong-Ho Lee, and Hyoung-Joo Kim. "Nearest Neighbor Query Processing using the Spherical Pyramid Technique," in Journal of KIISE : database, vol. 28, No. 1, Mar. 2001.   과학기술학회마을
5 Yingyuan Xiao. "Set Nearest Neighbor Query for Trajectory of Moving Objects," Fuzzy Systems and Knowledge Discovery, Volume. 5, pp. 211-214, Aug. 2009.
6 Sung-Hyun Shin, Sang-Chul Lee, Sang-Wook Kim, Junghoon Lee, and Eul-Gyu Im. "Efficient Path Finding Based on the A$^*$ algorithm for Processing k-Nearest Neighbor Queries in Road Network Databases," in Journal of KIISE : database, Vol. 36, No. 5, Oct. 2009.   과학기술학회마을
7 Elias Frentzos, Kostas Gratsias, Nikos Pelekis, and Yannis Theodoridis, "Algorithms for Nearest Neighbor Search on Moving Object Trajectories," Joutnal of GeoInformatica, Volume 11, Number 2, pp. 159-193, 2007.   DOI   ScienceOn
8 Dong-Man Lee, Yong-Ju Lee, and Chin-Wan Cung. "Research on the Nearest Neighbor Query Processing using R-trees," in Journal of KIISE : database, Vol. 23, No. 2(A), pp. 35-38, 1996.