...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Systems >Continuous visible k nearest neighbor query on moving objects
【24h】

Continuous visible k nearest neighbor query on moving objects

机译：对运动对象的连续可见k最近邻查询

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

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.
机译：可见的k个最近邻居（Vk NN）查询检索k个可见且最接近查询对象的对象，其中“可见”表示在对象和查询对象之间没有障碍。关于Vk NN查询的现有研究集中在静态数据对象上。在本文中，我们研究了如何连续处理运动对象上的查询。我们提出了一个有效的过滤和优化框架来评估这种类型的查询。我们利用查询对象和数据对象之间的空间邻近性和可见性属性来修剪此框架下的搜索空间。对提议的框架进行了详细的成本分析和全面的实验研究。结果验证了修剪技术的有效性，并验证了所提出框架的效率。所提出的框架在通信和计算成本方面都比直接解决方案好一个数量级。

著录项

  • 来源
    《Information Systems》 |2014年第8期|1-21|共21页
  • 作者

    Yanqiu Wang; Rui Zhang; Chuanfei Xu; Jianzhong Qi; Yu Gu; Ge Yu;

  • 作者单位

    Department of Computer Software and Theory, Northeastern University, China;

    Department of Computing and Information Systems, University of Melbourne, Australia;

    Department of Computer Software and Theory, Northeastern University, China;

    Department of Computing and Information Systems, University of Melbourne, Australia;

    Department of Computer Software and Theory, Northeastern University, China;

    Department of Computer Software and Theory, Northeastern University, China;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Spatio-temporal databases; Continuous visible k nearest neighbor; queries; Safe region; Invisible time period;

    机译：时空数据库;连续可见k最近邻;查询;安全区域;隐形时间段;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号