TSC-IRNN : Time- and Space-Constraint In-Route Nearest Neighbor Query Processing Algorithms in Spatial Network Databases

スポンサーリンク

概要

• 論文の詳細を見る

• Although a large number of query processing algorithms in spatial network database (SNDB) have been studied, there exists little research on route-based queries. Since moving objects move only in spatial networks, route-based queries, like in-route nearest neighbor (IRNN), are essential for Location-based Service (LBS) and Telematics applications. However, the existing IRNN query processing algorithm has a problem in that it does not consider time and space constraints. Therefore, we, in this paper, propose IRNN query processing algorithms which take both time and space constraints into consideration. Finally, we show the effectiveness of our IRNN query processing algorithms considering time and space constraints by comparing them with the existing IRNN algorithm.

• 2011-06-01

著者

• Chang Jae-woo

  Dept. Of Computer Eng. Chonbuk National Univ.

• Kim Yong-ki

  Dept. Of Computer Eng. Chonbuk National Univ.

• KIM Yong-Ki

  Dept. of Computer Eng., Chonbuk National Univ.

関連論文

• A New Similar Trajectory Search Algorithm Based on Spatio-Temporal Similarity Measure for Moving Objects in Road Networks
• A New Signature-Based Indexing Scheme for Efficient Trajectory Retrieval in Spatial Networks
• TSC-IRNN : Time- and Space-Constraint In-Route Nearest Neighbor Query Processing Algorithms in Spatial Network Databases
• Improving Data Confidentiality and Integrity for Data Aggregation in Wireless Sensor Networks

スポンサーリンク