کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
397353 | 671181 | 2014 | 21 صفحه PDF | دانلود رایگان |
• We formulate the continuous visible k NN query on moving objects.
• We propose a filtering-and-refinement framework to process the query.
• We develop two pruning strategies to reduce the query search space.
• Cost analysis and experiments confirm the superiority of our framework.
A visible k nearest neighbor (Vk NN) query retrieves k objects that are visible and nearest to the query object, where “visible” means that there is no obstacle between an object and the query object. Existing studies on the Vk NN query have focused on static data objects. In this paper we investigate how to process the query on moving objects continuously. We propose an effective filtering-and-refinement framework for evaluating this type of queries. We exploit spatial proximity and visibility properties between the query object and data objects to prune search space under this framework. A detailed cost analysis and a comprehensive experimental study are conducted on the proposed framework. The results validate the effectiveness of the pruning techniques and verify the efficiency of the proposed framework. The proposed framework outperforms a straightforward solution by an order of magnitude in terms of both communication and computation costs.
Journal: Information Systems - Volume 44, August 2014, Pages 1–21