Browse > Article

In-Route Nearest Neighbor Query Processing Algorithm with Time Constraint in Spatial Network Databases  

Kim, Yong-Ki (전북대학교 컴퓨터공학과)
Kim, Sang-Mi (대두정보시스템 자판시스템팀)
Chang, Jae-Woo (전북대학교 컴퓨터공학과)
Abstract
Recently, the query processing algorithm in spatial network database (SNDB) has attracted many interests. However, there is little research on route-based query processing algorithm in SNDB. Since the moving objects moves only in spatial networks, the route-based algorithm is very useful for LBS and Telematics applications. In this paper, we analyze In-Route Nearest Neighbor (IRNN) query, which is an typical one of route-based queries, and propose a new IRNN query processing algorithm with time constraint. In addition, we show from our performance analysis that our IRNN query processing algorithm with time constraint is better on retrieval performance than the existing IRNN query processing one.
Keywords
Spatial network database; Query processing algorithm; In-Route Nearest Neighbor query;
Citations & Related Records
연도 인용수 순위
  • Reference
1 http://www.fh-oow.de/institute/iapg/personen/brinkhoff/generator/
2 T. Brinkhoff, 'A Framework for Generating Network-Based Moving Objects,' GeoInformation, Vol. 6, No.2, pp. 153-180, 2002   DOI   ScienceOn
3 Z. Song, and N. Roussopoulos, 'K-Nearest neighbor Search for Moving Query Point,' Proc. of SSTD, pp. 79-96, 2001
4 Y. Tao, D. Papadias, and Q. Shen, 'Continuous Nearest Neighbor Search,' Proc. of VLDB, pp. 287-298, 2002
5 S. Shekhar, and J.S. Yoo, 'Processing In-Route Nearest Neighbor Queries: A Comparison of Alternative Approaches,' Proc. of ACM GIS, pp.9-16, 2003
6 M.R. Kolahdouzan, and C. Shahabi, 'ContinuousK Nearest Neighbor Queries in Spatial Network Databases,' Proc. of STDBM, pp. 33-40, 2004
7 P. Sistla, O. Wolfson, S. Chamberlain, and S.Dao, 'Modeling and Querying Moving Objects,' Proc. of IEEE ICDE, pp. 422-432, 1997
8 Y. Tao, and D. Papadias, 'Time Parameterized Queries in Spatio-Temporal Databases,' Proc. of ACM SIGMOD, pp. 334-345, 2002