Continuous visible k nearest neighbor query on moving objects
作者:
Highlights:
• 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.
摘要
Highlights•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.
论文关键词:Spatio-temporal databases,Continuous visible k nearest neighbor queries,Safe region,Invisible time period
论文评审过程:Received 25 January 2013, Revised 6 August 2013, Accepted 5 February 2014, Available online 22 February 2014.
论文官网地址:https://doi.org/10.1016/j.is.2014.02.003