首页> 外文会议>Proceedings of 2009 IEEE international conference on network infrastructure and digital content >K-NEAREST NEIGHBOR QUERY PROCESSING METHODS IN ROAD NETWORK SPACE:PERFORMANCE EVALUATION
【24h】

K-NEAREST NEIGHBOR QUERY PROCESSING METHODS IN ROAD NETWORK SPACE:PERFORMANCE EVALUATION

机译:道路网络空间中的K-NEAREST邻居查询处理方法:性能评估

获取原文

摘要

The road network now opens a new application area for the classic k-NN queries, which retrieve k objects closest to a given query point. There are many previous methods for k-NN query processing. However, all of them are not sufficient in experimental evaluation of performance. In this paper, we present the way that extensively evaluates prior methods for processing of k-NN queries. To achieve this goal, we first describe well–known previous methods for retrieving k objects closest to a given query point. Next, we establish the criteria against which previous methods have been evaluated for k-NN query processing. Last, we build the experiment environment using the real network data and then perform extensive performance evaluation.
机译:道路网络现在为经典的k-NN查询打开一个新的应用程序区域,该区域检索最接近给定查询点的k个对象。以前有很多用于k-NN查询处理的方法。但是,所有这些都不足以对性能进行实验评估。在本文中,我们提出了广泛评估处理k-NN查询的现有方法的方法。为了实现此目标,我们首先描述众所周知的先前方法,该方法用于检索最接近给定查询点的k个对象。接下来,我们建立标准,针对k-NN查询处理评估了先前的方法。最后,我们使用真实的网络数据构建实验环境,然后进行广泛的性能评估。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号